Base | Representation |
---|---|
bin | 10111001101111001100010… |
… | …110011010011011000100001 |
3 | 111101112122022002221002202002 |
4 | 113031321202303103120201 |
5 | 101340433202242023014 |
6 | 1001100441040533345 |
7 | 30336135124136312 |
oct | 2715714263233041 |
9 | 441478262832662 |
10 | 102110210111009 |
11 | 2a598773666631 |
12 | b551786921255 |
13 | 44c8c4a591749 |
14 | 1b3023673a609 |
15 | bc11c3049dde |
hex | 5cde62cd3621 |
102110210111009 has 2 divisors, whose sum is σ = 102110210111010. Its totient is φ = 102110210111008.
The previous prime is 102110210110943. The next prime is 102110210111057. The reversal of 102110210111009 is 900111012011201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 77825302078225 + 24284908032784 = 8821865^2 + 4927972^2 .
It is an emirp because it is prime and its reverse (900111012011201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102110210111009 is a prime.
It is a super-2 number, since 2×1021102101110092 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (102110210111309) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51055105055504 + 51055105055505.
It is an arithmetic number, because the mean of its divisors is an integer number (51055105055505).
Almost surely, 2102110210111009 is an apocalyptic number.
It is an amenable number.
102110210111009 is a deficient number, since it is larger than the sum of its proper divisors (1).
102110210111009 is an equidigital number, since it uses as much as digits as its factorization.
102110210111009 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 20.
The spelling of 102110210111009 in words is "one hundred two trillion, one hundred ten billion, two hundred ten million, one hundred eleven thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •