Base | Representation |
---|---|
bin | 111000110111001100… |
… | …0111111111001010111 |
3 | 102200012010122012002202 |
4 | 1301232120333321113 |
5 | 4000040422144343 |
6 | 132032545155115 |
7 | 11552012326634 |
oct | 1615630777127 |
9 | 380163565082 |
10 | 122111131223 |
11 | 47872606274 |
12 | 1b7ba92ba9b |
13 | b6906a1943 |
14 | 5ca588d18b |
15 | 329a4badb8 |
hex | 1c6e63fe57 |
122111131223 has 4 divisors (see below), whose sum is σ = 129294138960. Its totient is φ = 114928123488.
The previous prime is 122111131183. The next prime is 122111131229. The reversal of 122111131223 is 322131111221.
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 122111131223 - 230 = 121037389399 is a prime.
It is a super-2 number, since 2×1221111312232 (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 = 122111131195 and 122111131204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122111131229) 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, 3591503843 + ... + 3591503876.
It is an arithmetic number, because the mean of its divisors is an integer number (32323534740).
Almost surely, 2122111131223 is an apocalyptic number.
122111131223 is a deficient number, since it is larger than the sum of its proper divisors (7183007737).
122111131223 is an equidigital number, since it uses as much as digits as its factorization.
122111131223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7183007736.
The product of its digits is 144, while the sum is 20.
Adding to 122111131223 its reverse (322131111221), we get a palindrome (444242242444).
The spelling of 122111131223 in words is "one hundred twenty-two billion, one hundred eleven million, one hundred thirty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •