Base | Representation |
---|---|
bin | 11001001111011100000110… |
… | …000011010001010001110100 |
3 | 112120001122200121011222211001 |
4 | 121033130012003101101310 |
5 | 104022310311013021322 |
6 | 1032034133042053044 |
7 | 32245234565115202 |
oct | 3117340603212164 |
9 | 476048617158731 |
10 | 111012121220212 |
11 | 3240aa81392253 |
12 | 1054aa8694a184 |
13 | 49c3523864c44 |
14 | 1d5b03011c072 |
15 | cc7a30191827 |
hex | 64f7060d1474 |
111012121220212 has 12 divisors (see below), whose sum is σ = 194271297904516. Its totient is φ = 55506036104640.
The previous prime is 111012121220173. The next prime is 111012121220243. The reversal of 111012121220212 is 212022121210111.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 60700989895056 + 50311131325156 = 7791084^2 + 7093034^2 .
It is a super-2 number, since 2×1110121212202122 (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 111012121220212.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7369912 + ... + 16623472.
Almost surely, 2111012121220212 is an apocalyptic number.
It is an amenable number.
111012121220212 is a deficient number, since it is larger than the sum of its proper divisors (83259176684304).
111012121220212 is a wasteful number, since it uses less digits than its factorization.
111012121220212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12252738 (or 12252736 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 111012121220212 its reverse (212022121210111), we get a palindrome (323034242430323).
The spelling of 111012121220212 in words is "one hundred eleven trillion, twelve billion, one hundred twenty-one million, two hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •