Base | Representation |
---|---|
bin | 10001011101100110010… |
… | …011010001000011101100 |
3 | 11020201102220200001021112 |
4 | 101131212103101003230 |
5 | 124130111110432340 |
6 | 2315140014051152 |
7 | 152461264264016 |
oct | 21354623210354 |
9 | 4221386601245 |
10 | 1200012202220 |
11 | 422a16670877 |
12 | 1746a17a9ab8 |
13 | 89211c9aa60 |
14 | 4211bdc31b6 |
15 | 21335ceb065 |
hex | 117664d10ec |
1200012202220 has 48 divisors (see below), whose sum is σ = 2746571073120. Its totient is φ = 437743090176.
The previous prime is 1200012202217. The next prime is 1200012202261. The reversal of 1200012202220 is 222022100021.
It is a junction number, because it is equal to n+sod(n) for n = 1200012202195 and 1200012202204.
It is an unprimeable number.
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, 27782225 + ... + 27825384.
It is an arithmetic number, because the mean of its divisors is an integer number (57220230690).
Almost surely, 21200012202220 is an apocalyptic number.
1200012202220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1200012202220 is an abundant number, since it is smaller than the sum of its proper divisors (1546558870900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1200012202220 is a wasteful number, since it uses less digits than its factorization.
1200012202220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55607714 (or 55607712 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 1200012202220 its reverse (222022100021), we get a palindrome (1422034302241).
The spelling of 1200012202220 in words is "one trillion, two hundred billion, twelve million, two hundred two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.291 sec. • engine limits •