Base | Representation |
---|---|
bin | 1001001101000100010100… |
… | …0010000010100110011110 |
3 | 1022211110202020122220012221 |
4 | 2103101011002002212132 |
5 | 2311301431341042342 |
6 | 33305035452415554 |
7 | 2063103353063443 |
oct | 223210502024636 |
9 | 38743666586187 |
10 | 10120101112222 |
11 | 3251a0227a262 |
12 | 11754154775ba |
13 | 5854242856ba |
14 | 26db5ba759ca |
15 | 1283a8c1ca67 |
hex | 9344508299e |
10120101112222 has 32 divisors (see below), whose sum is σ = 15272569128960. Its totient is φ = 5029330776960.
The previous prime is 10120101112211. The next prime is 10120101112241. The reversal of 10120101112222 is 22221110102101.
It is a super-2 number, since 2×101201011122222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10120101112196 and 10120101112205.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1707454623 + ... + 1707460549.
It is an arithmetic number, because the mean of its divisors is an integer number (477267785280).
Almost surely, 210120101112222 is an apocalyptic number.
10120101112222 is a deficient number, since it is larger than the sum of its proper divisors (5152468016738).
10120101112222 is a wasteful number, since it uses less digits than its factorization.
10120101112222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12336.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 10120101112222 its reverse (22221110102101), we get a palindrome (32341211214323).
The spelling of 10120101112222 in words is "ten trillion, one hundred twenty billion, one hundred one million, one hundred twelve thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •