Base | Representation |
---|---|
bin | 1011111011010011001110… |
… | …1111000100011000110011 |
3 | 1201102121222121111111100212 |
4 | 2332310303233010120303 |
5 | 3204322222200201233 |
6 | 43520114135134335 |
7 | 2522261232331016 |
oct | 276646357043063 |
9 | 51377877444325 |
10 | 13113403131443 |
11 | 41a63aa22492a |
12 | 15795702143ab |
13 | 741786236564 |
14 | 33499918d37d |
15 | 17b19a404a48 |
hex | bed33bc4633 |
13113403131443 has 8 divisors (see below), whose sum is σ = 13151795160000. Its totient is φ = 13075015776768.
The previous prime is 13113403131419. The next prime is 13113403131461. The reversal of 13113403131443 is 34413130431131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13113403131443 - 28 = 13113403131187 is a prime.
It is a super-2 number, since 2×131134031314432 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13113403134443) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4491158 + ... + 6811556.
It is an arithmetic number, because the mean of its divisors is an integer number (1643974395000).
Almost surely, 213113403131443 is an apocalyptic number.
13113403131443 is a deficient number, since it is larger than the sum of its proper divisors (38392028557).
13113403131443 is a wasteful number, since it uses less digits than its factorization.
13113403131443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2336941.
The product of its (nonzero) digits is 15552, while the sum is 32.
Adding to 13113403131443 its reverse (34413130431131), we get a palindrome (47526533562574).
The spelling of 13113403131443 in words is "thirteen trillion, one hundred thirteen billion, four hundred three million, one hundred thirty-one thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •