Base | Representation |
---|---|
bin | 110010000011001010111011… |
… | …100001011000110111101010 |
3 | 1001212101021202121020221110120 |
4 | 302003022323201120313222 |
5 | 212322422202310341020 |
6 | 2100053455535424110 |
7 | 64236106152515313 |
oct | 6203127341306752 |
9 | 1055337677227416 |
10 | 220120220012010 |
11 | 6415650874680a |
12 | 20830934385036 |
13 | 95a932b1ccca6 |
14 | 3c4dc384d960a |
15 | 1a6ac73389740 |
hex | c832bb858dea |
220120220012010 has 32 divisors (see below), whose sum is σ = 528289886210112. Its totient is φ = 58698574427520.
The previous prime is 220120220011969. The next prime is 220120220012023. The reversal of 220120220012010 is 10210022021022.
220120220012010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2201202200120102 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2686965 + ... + 21153255.
It is an arithmetic number, because the mean of its divisors is an integer number (16509058944066).
Almost surely, 2220120220012010 is an apocalyptic number.
220120220012010 is an abundant number, since it is smaller than the sum of its proper divisors (308169666198102).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220120220012010 is a wasteful number, since it uses less digits than its factorization.
220120220012010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18863638.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 220120220012010 its reverse (10210022021022), we get a palindrome (230330242033032).
The spelling of 220120220012010 in words is "two hundred twenty trillion, one hundred twenty billion, two hundred twenty million, twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •