Base | Representation |
---|---|
bin | 101101101111111111100000… |
… | …100010010111101111000011 |
3 | 222101102111102211022110100120 |
4 | 231233333200202113233003 |
5 | 202333111241101202321 |
6 | 1551534351024351323 |
7 | 60244643564636460 |
oct | 5557774042275703 |
9 | 871374384273316 |
10 | 201210100022211 |
11 | 591257a6a20635 |
12 | 1a697a47475543 |
13 | 88370531b4997 |
14 | 37988996aa667 |
15 | 183de0a7e3ec6 |
hex | b6ffe0897bc3 |
201210100022211 has 128 divisors (see below), whose sum is σ = 324221725900800. Its totient is φ = 108510720890880.
The previous prime is 201210100022189. The next prime is 201210100022311. The reversal of 201210100022211 is 112220001012102.
It is not a de Polignac number, because 201210100022211 - 26 = 201210100022147 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201210100022311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 53413881850 + ... + 53413885616.
It is an arithmetic number, because the mean of its divisors is an integer number (2532982233600).
Almost surely, 2201210100022211 is an apocalyptic number.
201210100022211 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
201210100022211 is a deficient number, since it is larger than the sum of its proper divisors (123011625878589).
201210100022211 is a wasteful number, since it uses less digits than its factorization.
201210100022211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6209.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 201210100022211 its reverse (112220001012102), we get a palindrome (313430101034313).
The spelling of 201210100022211 in words is "two hundred one trillion, two hundred ten billion, one hundred million, twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •