Base | Representation |
---|---|
bin | 10110101111010110100110… |
… | …001110001011011110001110 |
3 | 111010002222010200002212001100 |
4 | 112233112212032023132032 |
5 | 101102040214132102342 |
6 | 552412244401523530 |
7 | 30031364226364122 |
oct | 2657264616133616 |
9 | 433088120085040 |
10 | 100011102222222 |
11 | 29959519a14044 |
12 | b2729a39435a6 |
13 | 43a60112b16c9 |
14 | 1a9a7c54d1582 |
15 | b867b9301e4c |
hex | 5af5a638b78e |
100011102222222 has 48 divisors (see below), whose sum is σ = 225336442855680. Its totient is φ = 32018960299200.
The previous prime is 100011102222181. The next prime is 100011102222259. The reversal of 100011102222222 is 222222201110001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 100011102222195 and 100011102222204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 501450429 + ... + 501649832.
It is an arithmetic number, because the mean of its divisors is an integer number (4694509226160).
Almost surely, 2100011102222222 is an apocalyptic number.
100011102222222 is an abundant number, since it is smaller than the sum of its proper divisors (125325340633458).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100011102222222 is a wasteful number, since it uses less digits than its factorization.
100011102222222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1003100489 (or 1003100486 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 100011102222222 its reverse (222222201110001), we get a palindrome (322233303332223).
The spelling of 100011102222222 in words is "one hundred trillion, eleven billion, one hundred two million, two hundred twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •