Base | Representation |
---|---|
bin | 10111001101111001100010… |
… | …111011010110010001011101 |
3 | 111101112122022020220020201202 |
4 | 113031321202323112101131 |
5 | 101340433203312014442 |
6 | 1001100441154045245 |
7 | 30336135151102052 |
oct | 2715714273262135 |
9 | 441478266806652 |
10 | 102110212219997 |
11 | 2a5987748770a3 |
12 | b551787579825 |
13 | 44c8c4ab4c677 |
14 | 1b30236b29029 |
15 | bc11c3314c32 |
hex | 5cde62ed645d |
102110212219997 has 2 divisors, whose sum is σ = 102110212219998. Its totient is φ = 102110212219996.
The previous prime is 102110212219993. The next prime is 102110212220069. The reversal of 102110212219997 is 799912212011201.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 96022243220836 + 6087968999161 = 9799094^2 + 2467381^2 .
It is a cyclic number.
It is not a de Polignac number, because 102110212219997 - 22 = 102110212219993 is a prime.
It is a super-2 number, since 2×1021102122199972 (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 (102110212219993) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51055106109998 + 51055106109999.
It is an arithmetic number, because the mean of its divisors is an integer number (51055106109999).
Almost surely, 2102110212219997 is an apocalyptic number.
It is an amenable number.
102110212219997 is a deficient number, since it is larger than the sum of its proper divisors (1).
102110212219997 is an equidigital number, since it uses as much as digits as its factorization.
102110212219997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81648, while the sum is 47.
The spelling of 102110212219997 in words is "one hundred two trillion, one hundred ten billion, two hundred twelve million, two hundred nineteen thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •