Base | Representation |
---|---|
bin | 111000110111001100… |
… | …0111101011100111110 |
3 | 102200012010121200101001 |
4 | 1301232120331130332 |
5 | 4000040421334324 |
6 | 132032545040514 |
7 | 11552012255515 |
oct | 1615630753476 |
9 | 380163550331 |
10 | 122111121214 |
11 | 478725a97a5 |
12 | 1b7ba92613a |
13 | b69069a214 |
14 | 5ca588967c |
15 | 329a4b7e44 |
hex | 1c6e63d73e |
122111121214 has 16 divisors (see below), whose sum is σ = 187448030208. Its totient is φ = 59633780472.
The previous prime is 122111121211. The next prime is 122111121217. The reversal of 122111121214 is 412121111221.
It is an interprime number because it is at equal distance from previous prime (122111121211) and next prime (122111121217).
It is a super-2 number, since 2×1221111212142 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122111121191 and 122111121200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122111121211) by changing a digit.
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, 1287954 + ... + 1379509.
It is an arithmetic number, because the mean of its divisors is an integer number (11715501888).
Almost surely, 2122111121214 is an apocalyptic number.
122111121214 is a deficient number, since it is larger than the sum of its proper divisors (65336908994).
122111121214 is a wasteful number, since it uses less digits than its factorization.
122111121214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2667999.
The product of its digits is 64, while the sum is 19.
Adding to 122111121214 its reverse (412121111221), we get a palindrome (534232232435).
The spelling of 122111121214 in words is "one hundred twenty-two billion, one hundred eleven million, one hundred twenty-one thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •