Base | Representation |
---|---|
bin | 10000000010100000010… |
… | …011111010011000101100 |
3 | 10220100222022000102111220 |
4 | 100002200103322120230 |
5 | 121024302001432340 |
6 | 2202202204543340 |
7 | 142426400431506 |
oct | 20024023723054 |
9 | 3810868012456 |
10 | 1102201202220 |
11 | 395493931888 |
12 | 159744b51b50 |
13 | 7cc24b3abb1 |
14 | 3b4bd978d76 |
15 | 1da0dd58ed0 |
hex | 100a04fa62c |
1102201202220 has 48 divisors (see below), whose sum is σ = 3113474565600. Its totient is φ = 291319254016.
The previous prime is 1102201202213. The next prime is 1102201202243. The reversal of 1102201202220 is 222021022011.
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 1102201202220.
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, 81276495 + ... + 81290054.
It is an arithmetic number, because the mean of its divisors is an integer number (64864053450).
Almost surely, 21102201202220 is an apocalyptic number.
1102201202220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1102201202220 is an abundant number, since it is smaller than the sum of its proper divisors (2011273363380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102201202220 is a wasteful number, since it uses less digits than its factorization.
1102201202220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162566674 (or 162566672 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 1102201202220 its reverse (222021022011), we get a palindrome (1324222224231).
The spelling of 1102201202220 in words is "one trillion, one hundred two billion, two hundred one million, two hundred two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •