Base | Representation |
---|---|
bin | 10110110000101011010000… |
… | …001110010011101101000111 |
3 | 111010102122202120120222121221 |
4 | 112300223100032103231013 |
5 | 101110032344302242411 |
6 | 552522120254421211 |
7 | 30041062623141604 |
oct | 2660532016235507 |
9 | 433378676528557 |
10 | 100102001212231 |
11 | 29994025037687 |
12 | b288531801807 |
13 | 43b1769435725 |
14 | 1aa0d699656ab |
15 | b88d3955b071 |
hex | 5b0ad0393b47 |
100102001212231 has 2 divisors, whose sum is σ = 100102001212232. Its totient is φ = 100102001212230.
The previous prime is 100102001212189. The next prime is 100102001212303. The reversal of 100102001212231 is 132212100201001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100102001212231 - 225 = 100101967657799 is a prime.
It is a super-2 number, since 2×1001020012122312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100102001222231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50051000606115 + 50051000606116.
It is an arithmetic number, because the mean of its divisors is an integer number (50051000606116).
Almost surely, 2100102001212231 is an apocalyptic number.
100102001212231 is a deficient number, since it is larger than the sum of its proper divisors (1).
100102001212231 is an equidigital number, since it uses as much as digits as its factorization.
100102001212231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 100102001212231 its reverse (132212100201001), we get a palindrome (232314101413232).
The spelling of 100102001212231 in words is "one hundred trillion, one hundred two billion, one million, two hundred twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •