Base | Representation |
---|---|
bin | 1001000111010011111010… |
… | …1011001011101011101001 |
3 | 1022111000111100222111201201 |
4 | 2101310332223023223221 |
5 | 2303141414303142001 |
6 | 33151402545244201 |
7 | 2053002634216315 |
oct | 221647653135351 |
9 | 38430440874651 |
10 | 10021210209001 |
11 | 3213a75a01a72 |
12 | 115a217033661 |
13 | 578cc4490354 |
14 | 26905a040b45 |
15 | 125a1c064501 |
hex | 91d3eacbae9 |
10021210209001 has 2 divisors, whose sum is σ = 10021210209002. Its totient is φ = 10021210209000.
The previous prime is 10021210208993. The next prime is 10021210209011. The reversal of 10021210209001 is 10090201212001.
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., 8721974983401 + 1299235225600 = 2953299^2 + 1139840^2 .
It is a cyclic number.
It is not a de Polignac number, because 10021210209001 - 23 = 10021210208993 is a prime.
It is a super-2 number, since 2×100212102090012 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10021210209001.
It is not a weakly prime, because it can be changed into another prime (10021210209011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5010605104500 + 5010605104501.
It is an arithmetic number, because the mean of its divisors is an integer number (5010605104501).
Almost surely, 210021210209001 is an apocalyptic number.
It is an amenable number.
10021210209001 is a deficient number, since it is larger than the sum of its proper divisors (1).
10021210209001 is an equidigital number, since it uses as much as digits as its factorization.
10021210209001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 19.
The spelling of 10021210209001 in words is "ten trillion, twenty-one billion, two hundred ten million, two hundred nine thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.274 sec. • engine limits •