Base | Representation |
---|---|
bin | 10001110001001111111… |
… | …000110010101111010110 |
3 | 11022201220022210000202011 |
4 | 101301033320302233112 |
5 | 130001313404000042 |
6 | 2332545354334434 |
7 | 154136161146034 |
oct | 21611770625726 |
9 | 4281808700664 |
10 | 1221111000022 |
11 | 430963363951 |
12 | 1787ab72a41a |
13 | 8b1c51c50b4 |
14 | 431601b3554 |
15 | 21b6d261a17 |
hex | 11c4fe32bd6 |
1221111000022 has 4 divisors (see below), whose sum is σ = 1831666500036. Its totient is φ = 610555500010.
The previous prime is 1221111000013. The next prime is 1221111000023. The reversal of 1221111000022 is 2200001111221.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×12211110000222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1221110999966 and 1221111000011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1221111000023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 305277750004 + ... + 305277750007.
It is an arithmetic number, because the mean of its divisors is an integer number (457916625009).
Almost surely, 21221111000022 is an apocalyptic number.
1221111000022 is a deficient number, since it is larger than the sum of its proper divisors (610555500014).
1221111000022 is an equidigital number, since it uses as much as digits as its factorization.
1221111000022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 610555500013.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1221111000022 its reverse (2200001111221), we get a palindrome (3421112111243).
The spelling of 1221111000022 in words is "one trillion, two hundred twenty-one billion, one hundred eleven million, twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •