Base | Representation |
---|---|
bin | 10001110000001110011… |
… | …001010001111011001100 |
3 | 11022122001202020020001210 |
4 | 101300032121101323030 |
5 | 124442041112020413 |
6 | 2332244343534420 |
7 | 154100016524043 |
oct | 21601631217314 |
9 | 4278052206053 |
10 | 1220012220108 |
11 | 43044a102280 |
12 | 17854375a410 |
13 | 8b07b680876 |
14 | 430982b155a |
15 | 21b06a6c3c3 |
hex | 11c0e651ecc |
1220012220108 has 48 divisors (see below), whose sum is σ = 3135636032256. Its totient is φ = 366111341760.
The previous prime is 1220012220107. The next prime is 1220012220109. The reversal of 1220012220108 is 8010222100221.
It is an interprime number because it is at equal distance from previous prime (1220012220107) and next prime (1220012220109).
It is not an unprimeable number, because it can be changed into a prime (1220012220103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 44852991 + ... + 44880182.
It is an arithmetic number, because the mean of its divisors is an integer number (65325750672).
Almost surely, 21220012220108 is an apocalyptic number.
It is an amenable number.
1220012220108 is an abundant number, since it is smaller than the sum of its proper divisors (1915623812148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220012220108 is a wasteful number, since it uses less digits than its factorization.
1220012220108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89733294 (or 89733292 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 1220012220108 its reverse (8010222100221), we get a palindrome (9230234320329).
The spelling of 1220012220108 in words is "one trillion, two hundred twenty billion, twelve million, two hundred twenty thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •