Base | Representation |
---|---|
bin | 1001100011110011000011… |
… | …10000101100010100001001 |
3 | 2202102121102021102200220010 |
4 | 10301321201300230110021 |
5 | 10223402414241213001 |
6 | 112413002142422133 |
7 | 4266506116453035 |
oct | 461714160542411 |
9 | 82377367380803 |
10 | 21021210101001 |
11 | 6775055097820 |
12 | 2436074891949 |
13 | b963a38771a6 |
14 | 5296095891c5 |
15 | 266c236eb8d6 |
hex | 131e61c2c509 |
21021210101001 has 32 divisors (see below), whose sum is σ = 31235098134528. Its totient is φ = 12465773378240.
The previous prime is 21021210100991. The next prime is 21021210101051. The reversal of 21021210101001 is 10010101212012.
It is a cyclic number.
It is not a de Polignac number, because 21021210101001 - 27 = 21021210100873 is a prime.
It is a super-2 number, since 2×210212101010012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21021210101051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4104406 + ... + 7673888.
It is an arithmetic number, because the mean of its divisors is an integer number (976096816704).
Almost surely, 221021210101001 is an apocalyptic number.
It is an amenable number.
21021210101001 is a deficient number, since it is larger than the sum of its proper divisors (10213888033527).
21021210101001 is a wasteful number, since it uses less digits than its factorization.
21021210101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3573341.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 21021210101001 its reverse (10010101212012), we get a palindrome (31031311313013).
The spelling of 21021210101001 in words is "twenty-one trillion, twenty-one billion, two hundred ten million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •