Base | Representation |
---|---|
bin | 10110101111010111011011… |
… | …110111010101000110011100 |
3 | 111010010001110101120120020011 |
4 | 112233113123313111012130 |
5 | 101102044040030431022 |
6 | 552412513551333004 |
7 | 30031425435156655 |
oct | 2657273367250634 |
9 | 433101411516204 |
10 | 100012002202012 |
11 | 29959940a3219a |
12 | b272bb5221164 |
13 | 43a612589bb24 |
14 | 1a9a86cc4452c |
15 | b8681d327977 |
hex | 5af5dbdd519c |
100012002202012 has 12 divisors (see below), whose sum is σ = 175025349568440. Its totient is φ = 50004759468176.
The previous prime is 100012002201973. The next prime is 100012002202019. The reversal of 100012002202012 is 210202200210001.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 100012002201983 and 100012002202001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100012002202019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 310226962 + ... + 310549177.
It is an arithmetic number, because the mean of its divisors is an integer number (14585445797370).
Almost surely, 2100012002202012 is an apocalyptic number.
It is an amenable number.
100012002202012 is a deficient number, since it is larger than the sum of its proper divisors (75013347366428).
100012002202012 is a wasteful number, since it uses less digits than its factorization.
100012002202012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 620816420 (or 620816418 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 100012002202012 its reverse (210202200210001), we get a palindrome (310214202412013).
The spelling of 100012002202012 in words is "one hundred trillion, twelve billion, two million, two hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •