Base | Representation |
---|---|
bin | 10001110001001001010… |
… | …001011100010011011011 |
3 | 11022201121120221201102211 |
4 | 101301021101130103123 |
5 | 130001102001134321 |
6 | 2332530351535551 |
7 | 154133342636455 |
oct | 21611121342333 |
9 | 4281546851384 |
10 | 1221000021211 |
11 | 430906753923 |
12 | 17877a52a5b7 |
13 | 8b1a8209369 |
14 | 4314d5652d5 |
15 | 21b6363e0e1 |
hex | 11c4945c4db |
1221000021211 has 4 divisors (see below), whose sum is σ = 1222150823424. Its totient is φ = 1219849219000.
The previous prime is 1221000021181. The next prime is 1221000021239. The reversal of 1221000021211 is 1121200001221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1221000021211 - 27 = 1221000021083 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1221000021191 and 1221000021200.
It is not an unprimeable number, because it can be changed into a prime (1221000021011) 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 3 ways as a sum of consecutive naturals, for example, 575399515 + ... + 575401636.
It is an arithmetic number, because the mean of its divisors is an integer number (305537705856).
Almost surely, 21221000021211 is an apocalyptic number.
1221000021211 is a deficient number, since it is larger than the sum of its proper divisors (1150802213).
1221000021211 is a wasteful number, since it uses less digits than its factorization.
1221000021211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1150802212.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1221000021211 its reverse (1121200001221), we get a palindrome (2342200022432).
The spelling of 1221000021211 in words is "one trillion, two hundred twenty-one billion, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •