Base | Representation |
---|---|
bin | 111000111101001011… |
… | …1010000011000000111 |
3 | 102200201010121102200021 |
4 | 1301322113100120013 |
5 | 4000443333013111 |
6 | 132104522400011 |
7 | 11560001566123 |
oct | 1617227203007 |
9 | 380633542607 |
10 | 122312001031 |
11 | 47965a32780 |
12 | 1b856060007 |
13 | b6c31a1b0c |
14 | 5cc441a583 |
15 | 32ace47d71 |
hex | 1c7a5d0607 |
122312001031 has 16 divisors (see below), whose sum is σ = 136146562848. Its totient is φ = 108944179200.
The previous prime is 122312000971. The next prime is 122312001101. The reversal of 122312001031 is 130100213221.
It is a cyclic number.
It is not a de Polignac number, because 122312001031 - 27 = 122312000903 is a prime.
It is a super-2 number, since 2×1223120010312 (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 = 122312000996 and 122312001014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122312001131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 182190 + ... + 527083.
It is an arithmetic number, because the mean of its divisors is an integer number (8509160178).
Almost surely, 2122312001031 is an apocalyptic number.
122312001031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
122312001031 is a deficient number, since it is larger than the sum of its proper divisors (13834561817).
122312001031 is a wasteful number, since it uses less digits than its factorization.
122312001031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 709602.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 122312001031 its reverse (130100213221), we get a palindrome (252412214252).
The spelling of 122312001031 in words is "one hundred twenty-two billion, three hundred twelve million, one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •