Base | Representation |
---|---|
bin | 1001101001000000010000… |
… | …11111011001001000110011 |
3 | 2210001201011111020222022111 |
4 | 10310200020133121020303 |
5 | 10234320301330121321 |
6 | 113031105243550151 |
7 | 4315441160256331 |
oct | 464401037311063 |
9 | 83051144228274 |
10 | 21200101020211 |
11 | 6833a04382103 |
12 | 246487ab2b357 |
13 | baa2127ab6c9 |
14 | 534139d60b51 |
15 | 26b6e38785e1 |
hex | 1348087d9233 |
21200101020211 has 32 divisors (see below), whose sum is σ = 21531743354880. Its totient is φ = 20871814973184.
The previous prime is 21200101020169. The next prime is 21200101020221. The reversal of 21200101020211 is 11202010100212.
It is a cyclic number.
It is not a de Polignac number, because 21200101020211 - 213 = 21200101012019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21200101020191 and 21200101020200.
It is not an unprimeable number, because it can be changed into a prime (21200101020221) 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, 19220399286 + ... + 19220400388.
It is an arithmetic number, because the mean of its divisors is an integer number (672866979840).
Almost surely, 221200101020211 is an apocalyptic number.
21200101020211 is a deficient number, since it is larger than the sum of its proper divisors (331642334669).
21200101020211 is a wasteful number, since it uses less digits than its factorization.
21200101020211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3115.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 21200101020211 its reverse (11202010100212), we get a palindrome (32402111120423).
The spelling of 21200101020211 in words is "twenty-one trillion, two hundred billion, one hundred one million, twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •