Base | Representation |
---|---|
bin | 101111110000001101011111… |
… | …100111100011000111100001 |
3 | 1000112121211110020020110102201 |
4 | 233300031133213203013201 |
5 | 210011441414230310311 |
6 | 2022402224550413201 |
7 | 62144350241045161 |
oct | 5760153747430741 |
9 | 1015554406213381 |
10 | 210021210010081 |
11 | 60a12549899918 |
12 | 1b67b626361201 |
13 | 9025bb86ac812 |
14 | 39c111ba125a1 |
15 | 19432010b49c1 |
hex | bf035f9e31e1 |
210021210010081 has 2 divisors, whose sum is σ = 210021210010082. Its totient is φ = 210021210010080.
The previous prime is 210021210010049. The next prime is 210021210010097. The reversal of 210021210010081 is 180010012120012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 190181089659456 + 19840120350625 = 13790616^2 + 4454225^2 .
It is a cyclic number.
It is not a de Polignac number, because 210021210010081 - 25 = 210021210010049 is a prime.
It is a super-2 number, since 2×2100212100100812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (210021210016081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105010605005040 + 105010605005041.
It is an arithmetic number, because the mean of its divisors is an integer number (105010605005041).
Almost surely, 2210021210010081 is an apocalyptic number.
It is an amenable number.
210021210010081 is a deficient number, since it is larger than the sum of its proper divisors (1).
210021210010081 is an equidigital number, since it uses as much as digits as its factorization.
210021210010081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 210021210010081 its reverse (180010012120012), we get a palindrome (390031222130093).
The spelling of 210021210010081 in words is "two hundred ten trillion, twenty-one billion, two hundred ten million, ten thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •