Base | Representation |
---|---|
bin | 111000111010011110… |
… | …0111000011101001111 |
3 | 102200110210202022202201 |
4 | 1301310330320131033 |
5 | 4000302111414411 |
6 | 132051520302331 |
7 | 11554520032513 |
oct | 1616474703517 |
9 | 380423668681 |
10 | 122221201231 |
11 | 47919755518 |
12 | 1b82b7719a7 |
13 | b6aa42cb1c |
14 | 5cb6342143 |
15 | 32a4eae3c1 |
hex | 1c74f3874f |
122221201231 has 4 divisors (see below), whose sum is σ = 125063554792. Its totient is φ = 119378847672.
The previous prime is 122221201229. The next prime is 122221201237. The reversal of 122221201231 is 132102122221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 122221201231 - 21 = 122221201229 is a prime.
It is a super-2 number, since 2×1222212012312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122221201199 and 122221201208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122221201237) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1421176716 + ... + 1421176801.
It is an arithmetic number, because the mean of its divisors is an integer number (31265888698).
Almost surely, 2122221201231 is an apocalyptic number.
122221201231 is a deficient number, since it is larger than the sum of its proper divisors (2842353561).
122221201231 is an equidigital number, since it uses as much as digits as its factorization.
122221201231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2842353560.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 122221201231 its reverse (132102122221), we get a palindrome (254323323452).
The spelling of 122221201231 in words is "one hundred twenty-two billion, two hundred twenty-one million, two hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •