Base | Representation |
---|---|
bin | 10110101111100000111101… |
… | …000001001100000111101100 |
3 | 111010011000211122010202001201 |
4 | 112233200331001030013230 |
5 | 101102231002330024322 |
6 | 552421324031415244 |
7 | 30032236623026422 |
oct | 2657407501140754 |
9 | 433130748122051 |
10 | 100022222111212 |
11 | 29963205898245 |
12 | b274b87984524 |
13 | 43a7093cc458b |
14 | 1a9b15c28d112 |
15 | b86c1a673d27 |
hex | 5af83d04c1ec |
100022222111212 has 24 divisors (see below), whose sum is σ = 175382574796800. Its totient is φ = 49912971166416.
The previous prime is 100022222111183. The next prime is 100022222111293. The reversal of 100022222111212 is 212111222220001.
It is a super-2 number, since 2×1000222221112122 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 100022222111212.
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 7 ways as a sum of consecutive naturals, for example, 112653 + ... + 14144155.
It is an arithmetic number, because the mean of its divisors is an integer number (7307607283200).
Almost surely, 2100022222111212 is an apocalyptic number.
It is an amenable number.
100022222111212 is a deficient number, since it is larger than the sum of its proper divisors (75360352685588).
100022222111212 is a wasteful number, since it uses less digits than its factorization.
100022222111212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14035005 (or 14035003 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 100022222111212 its reverse (212111222220001), we get a palindrome (312133444331213).
The spelling of 100022222111212 in words is "one hundred trillion, twenty-two billion, two hundred twenty-two million, one hundred eleven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •