Base | Representation |
---|---|
bin | 11101001010101111101… |
… | …10001011010111110000 |
3 | 10112210212010100222101010 |
4 | 32211113312023113300 |
5 | 112410002001400422 |
6 | 2044223241510520 |
7 | 132256323434040 |
oct | 16452766132760 |
9 | 3483763328333 |
10 | 1002201200112 |
11 | 3570384a5142 |
12 | 1422971a2440 |
13 | 7367932a508 |
14 | 36714917720 |
15 | 1b109b1db0c |
hex | e957d8b5f0 |
1002201200112 has 80 divisors (see below), whose sum is σ = 2960654236160. Its totient is φ = 286171474176.
The previous prime is 1002201200087. The next prime is 1002201200167. The reversal of 1002201200112 is 2110021022001.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 332788 + ... + 1454355.
It is an arithmetic number, because the mean of its divisors is an integer number (37008177952).
Almost surely, 21002201200112 is an apocalyptic number.
1002201200112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1002201200112 is an abundant number, since it is smaller than the sum of its proper divisors (1958453036048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1002201200112 is a wasteful number, since it uses less digits than its factorization.
1002201200112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1788830 (or 1788824 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1002201200112 its reverse (2110021022001), we get a palindrome (3112222222113).
The spelling of 1002201200112 in words is "one trillion, two billion, two hundred one million, two hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •