Base | Representation |
---|---|
bin | 10000010011010001010… |
… | …000010001100010000100 |
3 | 10222002102211001220220120 |
4 | 100103101100101202010 |
5 | 121323133230414340 |
6 | 2214340324501540 |
7 | 143634440414244 |
oct | 20232120214204 |
9 | 3862384056816 |
10 | 1120202201220 |
11 | 3a2090a36863 |
12 | 16112954a8b0 |
13 | 8183332b0ab |
14 | 3c30a585b24 |
15 | 1e21435d4d0 |
hex | 104d1411884 |
1120202201220 has 48 divisors (see below), whose sum is σ = 3136612647168. Its totient is φ = 298716160000.
The previous prime is 1120202201143. The next prime is 1120202201263. The reversal of 1120202201220 is 221022020211.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1120202201220.
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, 6921220 + ... + 7081220.
It is an arithmetic number, because the mean of its divisors is an integer number (65346096816).
Almost surely, 21120202201220 is an apocalyptic number.
1120202201220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1120202201220 is an abundant number, since it is smaller than the sum of its proper divisors (2016410445948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1120202201220 is a wasteful number, since it uses less digits than its factorization.
1120202201220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 276700 (or 276698 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 1120202201220 its reverse (221022020211), we get a palindrome (1341224221431).
The spelling of 1120202201220 in words is "one trillion, one hundred twenty billion, two hundred two million, two hundred one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •