Base | Representation |
---|---|
bin | 1001001100101110000010… |
… | …1011000100001001000111 |
3 | 1022210220022120122212100001 |
4 | 2103023200223010021013 |
5 | 2311202210313302302 |
6 | 33302210320102131 |
7 | 2062502244630511 |
oct | 223134053041107 |
9 | 38726276585301 |
10 | 10114122400327 |
11 | 324a414469550 |
12 | 1174227164947 |
13 | 5849b073145a |
14 | 26d751a08bb1 |
15 | 128158ddc787 |
hex | 932e0ac4247 |
10114122400327 has 8 divisors (see below), whose sum is σ = 11034038736000. Its totient is φ = 9194281175160.
The previous prime is 10114122400309. The next prime is 10114122400337. The reversal of 10114122400327 is 72300422141101.
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 10114122400327 - 243 = 1318029378119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10114122400295 and 10114122400304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10114122400337) 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, 18495883 + ... + 19034860.
It is an arithmetic number, because the mean of its divisors is an integer number (1379254842000).
Almost surely, 210114122400327 is an apocalyptic number.
10114122400327 is a deficient number, since it is larger than the sum of its proper divisors (919916335673).
10114122400327 is a wasteful number, since it uses less digits than its factorization.
10114122400327 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37555253.
The product of its (nonzero) digits is 2688, while the sum is 28.
Adding to 10114122400327 its reverse (72300422141101), we get a palindrome (82414544541428).
The spelling of 10114122400327 in words is "ten trillion, one hundred fourteen billion, one hundred twenty-two million, four hundred thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •