Base | Representation |
---|---|
bin | 10001110000010100111… |
… | …001000101010000000101 |
3 | 11022122100100022222221120 |
4 | 101300110321011100011 |
5 | 124442302013020401 |
6 | 2332303240104153 |
7 | 154102512152220 |
oct | 21602471052005 |
9 | 4278310288846 |
10 | 1220121220101 |
11 | 4304a5690613 |
12 | 178574165059 |
13 | 8b0981259c4 |
14 | 430a89665b7 |
15 | 21b113ed836 |
hex | 11c14e45405 |
1220121220101 has 16 divisors (see below), whose sum is σ = 1859675038848. Its totient is φ = 697046112000.
The previous prime is 1220121220081. The next prime is 1220121220121. The reversal of 1220121220101 is 1010221210221.
It is an interprime number because it is at equal distance from previous prime (1220121220081) and next prime (1220121220121).
It is not a de Polignac number, because 1220121220101 - 25 = 1220121220069 is a prime.
It is a super-3 number, since 3×12201212201013 (a number of 37 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220121220121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6826920 + ... + 7003361.
It is an arithmetic number, because the mean of its divisors is an integer number (116229689928).
Almost surely, 21220121220101 is an apocalyptic number.
It is an amenable number.
1220121220101 is a deficient number, since it is larger than the sum of its proper divisors (639553818747).
1220121220101 is a wasteful number, since it uses less digits than its factorization.
1220121220101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13834492.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1220121220101 its reverse (1010221210221), we get a palindrome (2230342430322).
The spelling of 1220121220101 in words is "one trillion, two hundred twenty billion, one hundred twenty-one million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •