Base | Representation |
---|---|
bin | 10110110000111100111101… |
… | …010110101101110110101110 |
3 | 111010111110211110202011211221 |
4 | 112300330331112231312232 |
5 | 101110340313033032342 |
6 | 552534542525533554 |
7 | 30042335004164401 |
oct | 2660747526556656 |
9 | 433443743664757 |
10 | 100121012002222 |
11 | 299a10a0142572 |
12 | b2901584142ba |
13 | 43b34a8bb04a3 |
14 | 1aa1c5070bd38 |
15 | b8959d527a67 |
hex | 5b0f3d5addae |
100121012002222 has 8 divisors (see below), whose sum is σ = 150196477842000. Its totient is φ = 50055519388224.
The previous prime is 100121012002201. The next prime is 100121012002223. The reversal of 100121012002222 is 222200210121001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 100121012002196 and 100121012002205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100121012002223) 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, 2493281347 + ... + 2493321502.
It is an arithmetic number, because the mean of its divisors is an integer number (18774559730250).
Almost surely, 2100121012002222 is an apocalyptic number.
100121012002222 is a deficient number, since it is larger than the sum of its proper divisors (50075465839778).
100121012002222 is a wasteful number, since it uses less digits than its factorization.
100121012002222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4986612890.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 100121012002222 its reverse (222200210121001), we get a palindrome (322321222123223).
The spelling of 100121012002222 in words is "one hundred trillion, one hundred twenty-one billion, twelve million, two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •