Base | Representation |
---|---|
bin | 101101101100111011110110… |
… | …010000110001111001011111 |
3 | 222100200102011100222000220011 |
4 | 231230323312100301321133 |
5 | 202321141010321041111 |
6 | 1551254044054104051 |
7 | 60223525436444245 |
oct | 5554736620617137 |
9 | 870612140860804 |
10 | 201000011112031 |
11 | 5905469823893a |
12 | 1a66319504b027 |
13 | 88202b1948491 |
14 | 378c649720795 |
15 | 183871179d021 |
hex | b6cef6431e5f |
201000011112031 has 2 divisors, whose sum is σ = 201000011112032. Its totient is φ = 201000011112030.
The previous prime is 201000011112007. The next prime is 201000011112161. The reversal of 201000011112031 is 130211110000102.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201000011112031 - 217 = 201000010980959 is a prime.
It is a super-2 number, since 2×2010000111120312 (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 (201000011112631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100500005556015 + 100500005556016.
It is an arithmetic number, because the mean of its divisors is an integer number (100500005556016).
Almost surely, 2201000011112031 is an apocalyptic number.
201000011112031 is a deficient number, since it is larger than the sum of its proper divisors (1).
201000011112031 is an equidigital number, since it uses as much as digits as its factorization.
201000011112031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 201000011112031 its reverse (130211110000102), we get a palindrome (331211121112133).
The spelling of 201000011112031 in words is "two hundred one trillion, eleven million, one hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •