Base | Representation |
---|---|
bin | 10111001100010011000110… |
… | …010110011011000100011110 |
3 | 111101011010101002101222202222 |
4 | 113030103012112123010132 |
5 | 101332132413021042342 |
6 | 1000534130004345342 |
7 | 30325162214105663 |
oct | 2714230626330436 |
9 | 441133332358688 |
10 | 102000211112222 |
11 | 2a55605703a775 |
12 | b5343a83a5252 |
13 | 44bb76a355497 |
14 | 1b28b9d737a6a |
15 | bbd3d609ded2 |
hex | 5cc4c659b11e |
102000211112222 has 8 divisors (see below), whose sum is σ = 162000335295936. Its totient is φ = 48000099346912.
The previous prime is 102000211112209. The next prime is 102000211112231. The reversal of 102000211112222 is 222211112000201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 102000211112222.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1500003104558 + ... + 1500003104625.
It is an arithmetic number, because the mean of its divisors is an integer number (20250041911992).
Almost surely, 2102000211112222 is an apocalyptic number.
102000211112222 is a deficient number, since it is larger than the sum of its proper divisors (60000124183714).
102000211112222 is a wasteful number, since it uses less digits than its factorization.
102000211112222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3000006209202.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 102000211112222 its reverse (222211112000201), we get a palindrome (324211323112423).
The spelling of 102000211112222 in words is "one hundred two trillion, two hundred eleven million, one hundred twelve thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •