Base | Representation |
---|---|
bin | 1001000110011001100101… |
… | …1100000110110100101101 |
3 | 1022102112002012101200201120 |
4 | 2101212121130012310231 |
5 | 2302412333044130123 |
6 | 33140253155331153 |
7 | 2051606635134243 |
oct | 221463134066455 |
9 | 38375065350646 |
10 | 10005553114413 |
11 | 320837098607a |
12 | 11571875b0ab9 |
13 | 57769a77803c |
14 | 2683b2850793 |
15 | 1254027052e3 |
hex | 91999706d2d |
10005553114413 has 8 divisors (see below), whose sum is σ = 13566851680800. Its totient is φ = 6557311645488.
The previous prime is 10005553114397. The next prime is 10005553114441. The reversal of 10005553114413 is 31441135550001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10005553114413 - 24 = 10005553114397 is a prime.
It is a super-2 number, since 2×100055531144132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10005553514413) 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, 28264274158 + ... + 28264274511.
It is an arithmetic number, because the mean of its divisors is an integer number (1695856460100).
Almost surely, 210005553114413 is an apocalyptic number.
It is an amenable number.
10005553114413 is a deficient number, since it is larger than the sum of its proper divisors (3561298566387).
10005553114413 is an equidigital number, since it uses as much as digits as its factorization.
10005553114413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56528548731.
The product of its (nonzero) digits is 18000, while the sum is 33.
Adding to 10005553114413 its reverse (31441135550001), we get a palindrome (41446688664414).
The spelling of 10005553114413 in words is "ten trillion, five billion, five hundred fifty-three million, one hundred fourteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •