Base | Representation |
---|---|
bin | 10110101111010111011011… |
… | …110111000001100111011010 |
3 | 111010010001110101102111202020 |
4 | 112233113123313001213122 |
5 | 101102044040020402302 |
6 | 552412513545515310 |
7 | 30031425434405202 |
oct | 2657273367014732 |
9 | 433101411374666 |
10 | 100012002122202 |
11 | 29959940988235 |
12 | b272bb51a2b36 |
13 | 43a61258716c1 |
14 | 1a9a86cc23402 |
15 | b8681d30debc |
hex | 5af5dbdc19da |
100012002122202 has 8 divisors (see below), whose sum is σ = 200024004244416. Its totient is φ = 33337334040732.
The previous prime is 100012002122141. The next prime is 100012002122209. The reversal of 100012002122202 is 202221200210001.
It is a sphenic number, since it is the product of 3 distinct primes.
100012002122202 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (100012002122209) 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, 8334333510178 + ... + 8334333510189.
It is an arithmetic number, because the mean of its divisors is an integer number (25003000530552).
Almost surely, 2100012002122202 is an apocalyptic number.
100012002122202 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100012002122202 is a wasteful number, since it uses less digits than its factorization.
100012002122202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16668667020372.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 100012002122202 its reverse (202221200210001), we get a palindrome (302233202332203).
The spelling of 100012002122202 in words is "one hundred trillion, twelve billion, two million, one hundred twenty-two thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •