Base | Representation |
---|---|
bin | 11101001010110000110… |
… | …00100001001000000000 |
3 | 10112210212202022022210112 |
4 | 32211120120201020000 |
5 | 112410011302431422 |
6 | 2044224202450452 |
7 | 132256463105660 |
oct | 16453030411000 |
9 | 3483782268715 |
10 | 1002210202112 |
11 | 357042593509 |
12 | 14229a203a28 |
13 | 7367b15ca42 |
14 | 36715bbc1a0 |
15 | 1b10a7eaee2 |
hex | e958621200 |
1002210202112 has 160 divisors (see below), whose sum is σ = 2299845550464. Its totient is φ = 427401216000.
The previous prime is 1002210202051. The next prime is 1002210202171. The reversal of 1002210202112 is 2112020122001.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 981596162 + ... + 981597182.
Almost surely, 21002210202112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1002210202112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1149922775232).
1002210202112 is an abundant number, since it is smaller than the sum of its proper divisors (1297635348352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1002210202112 is an equidigital number, since it uses as much as digits as its factorization.
1002210202112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2130 (or 2114 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1002210202112 its reverse (2112020122001), we get a palindrome (3114230324113).
The spelling of 1002210202112 in words is "one trillion, two billion, two hundred ten million, two hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •