Base | Representation |
---|---|
bin | 10111001100011101001010… |
… | …001101101000000011001111 |
3 | 111101012011020220200200012101 |
4 | 113030131022031220003033 |
5 | 101332322023403130244 |
6 | 1000543113525415531 |
7 | 30326024002344415 |
oct | 2714351215500317 |
9 | 441164226620171 |
10 | 102011013333199 |
11 | 2a55a69a672223 |
12 | b536501b6a5a7 |
13 | 44bc79c2c2709 |
14 | 1b295062432b5 |
15 | bbd8195c20d4 |
hex | 5cc74a3680cf |
102011013333199 has 2 divisors, whose sum is σ = 102011013333200. Its totient is φ = 102011013333198.
The previous prime is 102011013333157. The next prime is 102011013333367. The reversal of 102011013333199 is 991333310110201.
It is a weak prime.
It is an emirp because it is prime and its reverse (991333310110201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102011013333199 - 227 = 102010879115471 is a prime.
It is a super-2 number, since 2×1020110133331992 (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 (102011013033199) 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, 51005506666599 + 51005506666600.
It is an arithmetic number, because the mean of its divisors is an integer number (51005506666600).
Almost surely, 2102011013333199 is an apocalyptic number.
102011013333199 is a deficient number, since it is larger than the sum of its proper divisors (1).
102011013333199 is an equidigital number, since it uses as much as digits as its factorization.
102011013333199 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13122, while the sum is 37.
The spelling of 102011013333199 in words is "one hundred two trillion, eleven billion, thirteen million, three hundred thirty-three thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.456 sec. • engine limits •