Base | Representation |
---|---|
bin | 10110101111010101110000… |
… | …011100111001010000110011 |
3 | 111010002212210210121210220102 |
4 | 112233111300130321100303 |
5 | 101102031342212011011 |
6 | 552412015054303015 |
7 | 30031332663510533 |
oct | 2657256034712063 |
9 | 433085723553812 |
10 | 100010200110131 |
11 | 299590a6779963 |
12 | b2727917b7a6b |
13 | 43a5bc942887c |
14 | 1a9a73b7854c3 |
15 | b8676500973b |
hex | 5af570739433 |
100010200110131 has 2 divisors, whose sum is σ = 100010200110132. Its totient is φ = 100010200110130.
The previous prime is 100010200110091. The next prime is 100010200110143. The reversal of 100010200110131 is 131011002010001.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100010200110131 is a prime.
It is a super-2 number, since 2×1000102001101312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100010200110181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005100055065 + 50005100055066.
It is an arithmetic number, because the mean of its divisors is an integer number (50005100055066).
Almost surely, 2100010200110131 is an apocalyptic number.
100010200110131 is a deficient number, since it is larger than the sum of its proper divisors (1).
100010200110131 is an equidigital number, since it uses as much as digits as its factorization.
100010200110131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 100010200110131 its reverse (131011002010001), we get a palindrome (231021202120132).
The spelling of 100010200110131 in words is "one hundred trillion, ten billion, two hundred million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •