Base | Representation |
---|---|
bin | 10001110001001001010… |
… | …001101111110101011011 |
3 | 11022201121121002210011210 |
4 | 101301021101233311123 |
5 | 130001102011214321 |
6 | 2332530353354203 |
7 | 154133343421632 |
oct | 21611121576533 |
9 | 4281547083153 |
10 | 1221000101211 |
11 | 4309067a8a40 |
12 | 17877a568963 |
13 | 8b1a82368b7 |
14 | 4314d586519 |
15 | 21b63657b76 |
hex | 11c4946fd5b |
1221000101211 has 8 divisors (see below), whose sum is σ = 1776000147264. Its totient is φ = 740000061320.
The previous prime is 1221000101203. The next prime is 1221000101231. The reversal of 1221000101211 is 1121010001221.
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 1221000101211 - 23 = 1221000101203 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1221000101231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18500001501 + ... + 18500001566.
It is an arithmetic number, because the mean of its divisors is an integer number (222000018408).
Almost surely, 21221000101211 is an apocalyptic number.
1221000101211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1221000101211 is a deficient number, since it is larger than the sum of its proper divisors (555000046053).
1221000101211 is a wasteful number, since it uses less digits than its factorization.
1221000101211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37000003081.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1221000101211 its reverse (1121010001221), we get a palindrome (2342010102432).
It can be divided in two parts, 122100010 and 1211, that added together give a palindrome (122101221).
The spelling of 1221000101211 in words is "one trillion, two hundred twenty-one billion, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •