Base | Representation |
---|---|
bin | 10001110000010011101… |
… | …000111100000101000011 |
3 | 11022122021212210121220010 |
4 | 101300103220330011003 |
5 | 124442231123223021 |
6 | 2332301205520003 |
7 | 154102135451223 |
oct | 21602350740503 |
9 | 4278255717803 |
10 | 1220100211011 |
11 | 430494841130 |
12 | 178569113003 |
13 | 8b09397b1a6 |
14 | 430a5c58083 |
15 | 21b0e64d976 |
hex | 11c13a3c143 |
1220100211011 has 8 divisors (see below), whose sum is σ = 1774691216064. Its totient is φ = 739454673320.
The previous prime is 1220100210977. The next prime is 1220100211019. The reversal of 1220100211011 is 1101120010221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1220100211011 - 29 = 1220100210499 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1220100211019) 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, 18486366801 + ... + 18486366866.
It is an arithmetic number, because the mean of its divisors is an integer number (221836402008).
Almost surely, 21220100211011 is an apocalyptic number.
1220100211011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1220100211011 is a deficient number, since it is larger than the sum of its proper divisors (554591005053).
1220100211011 is a wasteful number, since it uses less digits than its factorization.
1220100211011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36972733681.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1220100211011 its reverse (1101120010221), we get a palindrome (2321220221232).
The spelling of 1220100211011 in words is "one trillion, two hundred twenty billion, one hundred million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •