Base | Representation |
---|---|
bin | 1001000110000101101001… |
… | …1111101011101110110000 |
3 | 1022102000021021120000111110 |
4 | 2101201122133223232300 |
5 | 2302320403220320422 |
6 | 33134010205113320 |
7 | 2051330221341621 |
oct | 221413237535660 |
9 | 38360237500443 |
10 | 10000202120112 |
11 | 3206075434936 |
12 | 1156133558840 |
13 | 577026ca5819 |
14 | 268025d03a48 |
15 | 1251dca6a60c |
hex | 9185a7ebbb0 |
10000202120112 has 80 divisors (see below), whose sum is σ = 28092777741792. Its totient is φ = 3052525916160.
The previous prime is 10000202120093. The next prime is 10000202120113. The reversal of 10000202120112 is 21102120200001.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (10000202120113) by changing a digit.
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, 165579939 + ... + 165640322.
Almost surely, 210000202120112 is an apocalyptic number.
10000202120112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10000202120112 is an abundant number, since it is smaller than the sum of its proper divisors (18092575621680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10000202120112 is a wasteful number, since it uses less digits than its factorization.
10000202120112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 331220326 (or 331220320 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10000202120112 its reverse (21102120200001), we get a palindrome (31102322320113).
The spelling of 10000202120112 in words is "ten trillion, two hundred two million, one hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •