Base | Representation |
---|---|
bin | 10111001100011110001010… |
… | …111111000000101100011101 |
3 | 111101012021001122111010122111 |
4 | 113030132022333000230131 |
5 | 101332331240101133041 |
6 | 1000543413425114021 |
7 | 30326062636134451 |
oct | 2714361277005435 |
9 | 441167048433574 |
10 | 102012100021021 |
11 | 2a5600a8014933 |
12 | b536765a88911 |
13 | 44bc913492068 |
14 | 1b295aa6b8661 |
15 | bbd87ebc8981 |
hex | 5cc78afc0b1d |
102012100021021 has 2 divisors, whose sum is σ = 102012100021022. Its totient is φ = 102012100021020.
The previous prime is 102012100021009. The next prime is 102012100021037. The reversal of 102012100021021 is 120120001210201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98628932064100 + 3383167956921 = 9931210^2 + 1839339^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102012100021021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102012100020992 and 102012100021010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102012100021121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51006050010510 + 51006050010511.
It is an arithmetic number, because the mean of its divisors is an integer number (51006050010511).
Almost surely, 2102012100021021 is an apocalyptic number.
It is an amenable number.
102012100021021 is a deficient number, since it is larger than the sum of its proper divisors (1).
102012100021021 is an equidigital number, since it uses as much as digits as its factorization.
102012100021021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102012100021021 its reverse (120120001210201), we get a palindrome (222132101231222).
The spelling of 102012100021021 in words is "one hundred two trillion, twelve billion, one hundred million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •