Base | Representation |
---|---|
bin | 10011110000011101… |
… | …000100100111101001 |
3 | 2000202102220222112000 |
4 | 103300131010213221 |
5 | 321421242201441 |
6 | 13425014041213 |
7 | 1350463132665 |
oct | 236035044751 |
9 | 60672828460 |
10 | 21214022121 |
11 | 8aa6842896 |
12 | 4140649209 |
13 | 200106b616 |
14 | 10536258a5 |
15 | 8426262b6 |
hex | 4f07449e9 |
21214022121 has 16 divisors (see below), whose sum is σ = 31471440000. Its totient is φ = 14123214864.
The previous prime is 21214022099. The next prime is 21214022143. The reversal of 21214022121 is 12122041212.
It is an interprime number because it is at equal distance from previous prime (21214022099) and next prime (21214022143).
It is not a de Polignac number, because 21214022121 - 214 = 21214005737 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21214022094 and 21214022103.
It is not an unprimeable number, because it can be changed into a prime (21214022171) 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 15 ways as a sum of consecutive naturals, for example, 520746 + ... + 560003.
It is an arithmetic number, because the mean of its divisors is an integer number (1966965000).
Almost surely, 221214022121 is an apocalyptic number.
It is an amenable number.
21214022121 is a deficient number, since it is larger than the sum of its proper divisors (10257417879).
21214022121 is a wasteful number, since it uses less digits than its factorization.
21214022121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1081485 (or 1081479 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 21214022121 its reverse (12122041212), we get a palindrome (33336063333).
The spelling of 21214022121 in words is "twenty-one billion, two hundred fourteen million, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •