Base | Representation |
---|---|
bin | 10001110000010011101… |
… | …100000010000100111011 |
3 | 11022122021221022211101011 |
4 | 101300103230002010323 |
5 | 124442231330201021 |
6 | 2332301235134351 |
7 | 154102145366524 |
oct | 21602354020473 |
9 | 4278257284334 |
10 | 1220101022011 |
11 | 430495245483 |
12 | 1785694443b7 |
13 | 8b093ba3381 |
14 | 430a5dc984b |
15 | 21b0e75dde1 |
hex | 11c13b0213b |
1220101022011 has 8 divisors (see below), whose sum is σ = 1247951485440. Its totient is φ = 1192329344808.
The previous prime is 1220101022003. The next prime is 1220101022017. The reversal of 1220101022011 is 1102201010221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1220101022011 - 23 = 1220101022003 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1220101021982 and 1220101022000.
It is not an unprimeable number, because it can be changed into a prime (1220101022017) by changing a digit.
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, 19665231 + ... + 19727176.
It is an arithmetic number, because the mean of its divisors is an integer number (155993935680).
Almost surely, 21220101022011 is an apocalyptic number.
1220101022011 is a deficient number, since it is larger than the sum of its proper divisors (27850463429).
1220101022011 is an equidigital number, since it uses as much as digits as its factorization.
1220101022011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39393113.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1220101022011 its reverse (1102201010221), we get a palindrome (2322302032232).
The spelling of 1220101022011 in words is "one trillion, two hundred twenty billion, one hundred one million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •