Base | Representation |
---|---|
bin | 11001010010011101111001… |
… | …000111000000100000001010 |
3 | 112120210112210122221210001221 |
4 | 121102131321013000200022 |
5 | 104034212442230310442 |
6 | 1032313505323032254 |
7 | 32266252325465113 |
oct | 3122357107004012 |
9 | 476715718853057 |
10 | 111220210010122 |
11 | 32490254055a94 |
12 | 1058327b36b68a |
13 | 4a0a036914425 |
14 | 1d671305bb20a |
15 | ccd15d7ee467 |
hex | 6527791c080a |
111220210010122 has 4 divisors (see below), whose sum is σ = 166830315015186. Its totient is φ = 55610105005060.
The previous prime is 111220210010099. The next prime is 111220210010311. The reversal of 111220210010122 is 221010012022111.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 70872674425281 + 40347535584841 = 8418591^2 + 6351971^2 .
It is a super-2 number, since 2×1112202100101222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111220210010096 and 111220210010105.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27805052502529 + ... + 27805052502532.
Almost surely, 2111220210010122 is an apocalyptic number.
111220210010122 is a deficient number, since it is larger than the sum of its proper divisors (55610105005064).
111220210010122 is an equidigital number, since it uses as much as digits as its factorization.
111220210010122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55610105005063.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 111220210010122 its reverse (221010012022111), we get a palindrome (332230222032233).
The spelling of 111220210010122 in words is "one hundred eleven trillion, two hundred twenty billion, two hundred ten million, ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •