Base | Representation |
---|---|
bin | 10011110000010001… |
… | …100101110001110011 |
3 | 2000202020021001200212 |
4 | 103300101211301303 |
5 | 321420004342321 |
6 | 13424425334335 |
7 | 1350425425514 |
oct | 236021456163 |
9 | 60666231625 |
10 | 21211012211 |
11 | 8aa5077464 |
12 | 413b6373ab |
13 | 20005565cc |
14 | 1053080a0b |
15 | 84222e55b |
hex | 4f0465c73 |
21211012211 has 8 divisors (see below), whose sum is σ = 21337664544. Its totient is φ = 21084406720.
The previous prime is 21211012189. The next prime is 21211012243. The reversal of 21211012211 is 11221011212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21211012211 is a prime.
It is a super-2 number, since 2×212110122112 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21211012811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1391471 + ... + 1406631.
It is an arithmetic number, because the mean of its divisors is an integer number (2667208068).
Almost surely, 221211012211 is an apocalyptic number.
21211012211 is a deficient number, since it is larger than the sum of its proper divisors (126652333).
21211012211 is a wasteful number, since it uses less digits than its factorization.
21211012211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23421.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 21211012211 its reverse (11221011212), we get a palindrome (32432023423).
Subtracting from 21211012211 its reverse (11221011212), we obtain a palindrome (9990000999).
The spelling of 21211012211 in words is "twenty-one billion, two hundred eleven million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •