Base | Representation |
---|---|
bin | 10000000010010100011… |
… | …000100101110101111010 |
3 | 10220100110100111021220010 |
4 | 100002110120211311322 |
5 | 121023344240232302 |
6 | 2202130300042350 |
7 | 142421420546520 |
oct | 20022430456572 |
9 | 3810410437803 |
10 | 1102001102202 |
11 | 3953a0990770 |
12 | 1596a9b333b6 |
13 | 7cbc254a210 |
14 | 3b4a116c310 |
15 | 1d9eb4d016c |
hex | 10094625d7a |
1102001102202 has 256 divisors, whose sum is σ = 2993080688640. Its totient is φ = 261201024000.
The previous prime is 1102001102173. The next prime is 1102001102263. The reversal of 1102001102202 is 2022011002011.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 644821324 + ... + 644823032.
It is an arithmetic number, because the mean of its divisors is an integer number (11691721440).
Almost surely, 21102001102202 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1102001102202, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1496540344320).
1102001102202 is an abundant number, since it is smaller than the sum of its proper divisors (1891079586438).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102001102202 is a wasteful number, since it uses less digits than its factorization.
1102001102202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2909.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1102001102202 its reverse (2022011002011), we get a palindrome (3124012104213).
The spelling of 1102001102202 in words is "one trillion, one hundred two billion, one million, one hundred two thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •