Base | Representation |
---|---|
bin | 10110110001000000… |
… | …11010101001110111 |
3 | 1011112210102201202100 |
4 | 23120200122221313 |
5 | 200012402423111 |
6 | 5340450313143 |
7 | 611610633600 |
oct | 133040325167 |
9 | 34483381670 |
10 | 12222311031 |
11 | 52021a31a7 |
12 | 24512887b3 |
13 | 11ca231108 |
14 | 83d36ada7 |
15 | 4b8035756 |
hex | 2d881aa77 |
12222311031 has 18 divisors (see below), whose sum is σ = 20536809072. Its totient is φ = 6984177480.
The previous prime is 12222310981. The next prime is 12222311033. The reversal of 12222311031 is 13011322221.
12222311031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12222311031 - 218 = 12222048887 is a prime.
It is a super-2 number, since 2×122223110312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12222310995 and 12222311013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12222311033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 13857055 + ... + 13857936.
Almost surely, 212222311031 is an apocalyptic number.
12222311031 is a deficient number, since it is larger than the sum of its proper divisors (8314498041).
12222311031 is a wasteful number, since it uses less digits than its factorization.
12222311031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27715011 (or 27715001 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 12222311031 its reverse (13011322221), we get a palindrome (25233633252).
The spelling of 12222311031 in words is "twelve billion, two hundred twenty-two million, three hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •