Base | Representation |
---|---|
bin | 1001010010100010011111… |
… | …0111101111100110110111 |
3 | 1100011110101021022210102022 |
4 | 2110220213313233212313 |
5 | 2314321434343413411 |
6 | 33420143203503355 |
7 | 2102641643210162 |
oct | 224504767574667 |
9 | 40143337283368 |
10 | 10214101154231 |
11 | 3288859903097 |
12 | 118b689987b5b |
13 | 591254a12530 |
14 | 274517cd8ad9 |
15 | 12aa5b32bedb |
hex | 94a27def9b7 |
10214101154231 has 16 divisors (see below), whose sum is σ = 11016768226464. Its totient is φ = 9413859771264.
The previous prime is 10214101154219. The next prime is 10214101154267. The reversal of 10214101154231 is 13245110141201.
It is not a de Polignac number, because 10214101154231 - 238 = 9939223247287 is a prime.
It is a super-2 number, since 2×102141011542312 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10214101154231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10214101154281) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 187583696 + ... + 187638138.
It is an arithmetic number, because the mean of its divisors is an integer number (688548014154).
Almost surely, 210214101154231 is an apocalyptic number.
10214101154231 is a deficient number, since it is larger than the sum of its proper divisors (802667072233).
10214101154231 is a wasteful number, since it uses less digits than its factorization.
10214101154231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76450.
The product of its (nonzero) digits is 960, while the sum is 26.
Adding to 10214101154231 its reverse (13245110141201), we get a palindrome (23459211295432).
The spelling of 10214101154231 in words is "ten trillion, two hundred fourteen billion, one hundred one million, one hundred fifty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •