Base | Representation |
---|---|
bin | 11101001010010111111… |
… | …11000110000110001010 |
3 | 10112210100020221021220210 |
4 | 32211023333012012022 |
5 | 112404100031224320 |
6 | 2044151412501550 |
7 | 132251356160340 |
oct | 16451377060612 |
9 | 3483306837823 |
10 | 1002002211210 |
11 | 356a46142900 |
12 | 14224061a8b6 |
13 | 736470384c0 |
14 | 366d6319990 |
15 | 1b0e74140e0 |
hex | e94bfc618a |
1002002211210 has 384 divisors, whose sum is σ = 3263306522112. Its totient is φ = 191600640000.
The previous prime is 1002002211113. The next prime is 1002002211227. The reversal of 1002002211210 is 121122002001.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 111316710 + ... + 111325710.
It is an arithmetic number, because the mean of its divisors is an integer number (8498194068).
Almost surely, 21002002211210 is an apocalyptic number.
1002002211210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1002002211210, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1631653261056).
1002002211210 is an abundant number, since it is smaller than the sum of its proper divisors (2261304310902).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1002002211210 is a wasteful number, since it uses less digits than its factorization.
1002002211210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9390 (or 9379 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1002002211210 its reverse (121122002001), we get a palindrome (1123124213211).
The spelling of 1002002211210 in words is "one trillion, two billion, two million, two hundred eleven thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •