Base | Representation |
---|---|
bin | 11101001000100110100… |
… | …101011010010011001100 |
3 | 21002101202221022122200221 |
4 | 131020212211122103030 |
5 | 230300301114214241 |
6 | 4131430352201124 |
7 | 264434646033001 |
oct | 35104645322314 |
9 | 7071687278627 |
10 | 2002102101196 |
11 | 7020a54945aa |
12 | 28402bb391a4 |
13 | 116a49c09732 |
14 | 6cc8bb258a8 |
15 | 3712c80c5d1 |
hex | 1d22695a4cc |
2002102101196 has 12 divisors (see below), whose sum is σ = 3503715736752. Its totient is φ = 1001040462128.
The previous prime is 2002102101193. The next prime is 2002102101211. The reversal of 2002102101196 is 6911012012002.
It is a happy number.
It is a super-2 number, since 2×20021021011962 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2002102101196.
It is not an unprimeable number, because it can be changed into a prime (2002102101191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2213800 + ... + 2984143.
It is an arithmetic number, because the mean of its divisors is an integer number (291976311396).
Almost surely, 22002102101196 is an apocalyptic number.
It is an amenable number.
2002102101196 is a deficient number, since it is larger than the sum of its proper divisors (1501613635556).
2002102101196 is a wasteful number, since it uses less digits than its factorization.
2002102101196 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5294240 (or 5294238 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 25.
Adding to 2002102101196 its reverse (6911012012002), we get a palindrome (8913114113198).
The spelling of 2002102101196 in words is "two trillion, two billion, one hundred two million, one hundred one thousand, one hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •