Base | Representation |
---|---|
bin | 110011101100101001… |
… | …1101111001010111110 |
3 | 101121120011201222002112 |
4 | 1213121103233022332 |
5 | 3304332110342342 |
6 | 123000224054022 |
7 | 11010115351010 |
oct | 1473123571276 |
9 | 347504658075 |
10 | 111020012222 |
11 | 430a09a2419 |
12 | 19624464312 |
13 | a613922c32 |
14 | 55328601b0 |
15 | 2d4b92d682 |
hex | 19d94ef2be |
111020012222 has 16 divisors (see below), whose sum is σ = 200336864640. Its totient is φ = 45075794328.
The previous prime is 111020012209. The next prime is 111020012231. The reversal of 111020012222 is 222210020111.
It is a super-2 number, since 2×1110200122222 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 111020012197 and 111020012206.
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 7 ways as a sum of consecutive naturals, for example, 208683968 + ... + 208684499.
It is an arithmetic number, because the mean of its divisors is an integer number (12521054040).
Almost surely, 2111020012222 is an apocalyptic number.
111020012222 is a deficient number, since it is larger than the sum of its proper divisors (89316852418).
111020012222 is a wasteful number, since it uses less digits than its factorization.
111020012222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 417368495.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 111020012222 its reverse (222210020111), we get a palindrome (333230032333).
The spelling of 111020012222 in words is "one hundred eleven billion, twenty million, twelve thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •