Base | Representation |
---|---|
bin | 10001110001001001111… |
… | …000010100010010100101 |
3 | 11022201122022010110120122 |
4 | 101301021320110102211 |
5 | 130001112103241010 |
6 | 2332531354211325 |
7 | 154133525362313 |
oct | 21611170242245 |
9 | 4281568113518 |
10 | 1221010212005 |
11 | 430911484371 |
12 | 178781a23b45 |
13 | 8b1aa366a0c |
14 | 43150a590b3 |
15 | 21b644a3855 |
hex | 11c49e144a5 |
1221010212005 has 8 divisors (see below), whose sum is σ = 1487081094432. Its totient is φ = 962228942928.
The previous prime is 1221010211987. The next prime is 1221010212017. The reversal of 1221010212005 is 5002120101221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1221010212005 - 232 = 1216715244709 is a prime.
It is a super-2 number, since 2×12210102120052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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, 1822402967 + ... + 1822403636.
It is an arithmetic number, because the mean of its divisors is an integer number (185885136804).
Almost surely, 21221010212005 is an apocalyptic number.
It is an amenable number.
1221010212005 is a deficient number, since it is larger than the sum of its proper divisors (266070882427).
1221010212005 is an equidigital number, since it uses as much as digits as its factorization.
1221010212005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3644806675.
The product of its (nonzero) digits is 80, while the sum is 17.
Adding to 1221010212005 its reverse (5002120101221), we get a palindrome (6223130313226).
The spelling of 1221010212005 in words is "one trillion, two hundred twenty-one billion, ten million, two hundred twelve thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •