Base | Representation |
---|---|
bin | 1001100011001111010001… |
… | …10111100110110100111011 |
3 | 2202100202211122000010111210 |
4 | 10301213220313212310323 |
5 | 10223044100003014321 |
6 | 112400104142254203 |
7 | 4265226121346100 |
oct | 461475067466473 |
9 | 82322748003453 |
10 | 21002002001211 |
11 | 6767998677090 |
12 | 24323b3b87363 |
13 | b9463227777a |
14 | 528706520aa7 |
15 | 26649c257b76 |
hex | 1319e8de6d3b |
21002002001211 has 48 divisors (see below), whose sum is σ = 36761229354240. Its totient is φ = 10533919475520.
The previous prime is 21002002001207. The next prime is 21002002001219. The reversal of 21002002001211 is 11210020020012.
It is not a de Polignac number, because 21002002001211 - 22 = 21002002001207 is a prime.
It is not an unprimeable number, because it can be changed into a prime (21002002001219) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 223888471 + ... + 223982256.
It is an arithmetic number, because the mean of its divisors is an integer number (765858944880).
Almost surely, 221002002001211 is an apocalyptic number.
21002002001211 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
21002002001211 is a deficient number, since it is larger than the sum of its proper divisors (15759227353029).
21002002001211 is a wasteful number, since it uses less digits than its factorization.
21002002001211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 447870784 (or 447870777 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 21002002001211 its reverse (11210020020012), we get a palindrome (32212022021223).
It can be divided in two parts, 210020020012 and 11, that multiplied together give a palindrome (2310220220132).
The spelling of 21002002001211 in words is "twenty-one trillion, two billion, two million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •