Base | Representation |
---|---|
bin | 10111001100010011110110… |
… | …000010001011110000100111 |
3 | 111101011012102211202020112101 |
4 | 113030103312002023300213 |
5 | 101332141032321103444 |
6 | 1000534341223232531 |
7 | 30325221100024525 |
oct | 2714236602136047 |
9 | 441135384666471 |
10 | 102001011112999 |
11 | 2a556427681139 |
12 | b5345902a8747 |
13 | 44bb86700881b |
14 | 1b28c37aa3315 |
15 | bbd4314263d4 |
hex | 5cc4f608bc27 |
102001011112999 has 2 divisors, whose sum is σ = 102001011113000. Its totient is φ = 102001011112998.
The previous prime is 102001011112997. The next prime is 102001011113003. The reversal of 102001011112999 is 999211110100201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102001011112999 - 21 = 102001011112997 is a prime.
Together with 102001011112997, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102001011112997) 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, 51000505556499 + 51000505556500.
It is an arithmetic number, because the mean of its divisors is an integer number (51000505556500).
Almost surely, 2102001011112999 is an apocalyptic number.
102001011112999 is a deficient number, since it is larger than the sum of its proper divisors (1).
102001011112999 is an equidigital number, since it uses as much as digits as its factorization.
102001011112999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 37.
The spelling of 102001011112999 in words is "one hundred two trillion, one billion, eleven million, one hundred twelve thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •