Base | Representation |
---|---|
bin | 10111001000110100… |
… | …11000000010001111 |
3 | 1012001201021201122020 |
4 | 23210122120002033 |
5 | 200420021212111 |
6 | 5412343421223 |
7 | 616554500652 |
oct | 134432300217 |
9 | 35051251566 |
10 | 12422054031 |
11 | 52a4a20062 |
12 | 24a8154813 |
13 | 122c72843a |
14 | 85bac3899 |
15 | 4ca83d906 |
hex | 2e469808f |
12422054031 has 4 divisors (see below), whose sum is σ = 16562738712. Its totient is φ = 8281369352.
The previous prime is 12422054027. The next prime is 12422054059. The reversal of 12422054031 is 13045022421.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13045022421 = 3 ⋅4348340807.
It is a cyclic number.
It is not a de Polignac number, because 12422054031 - 22 = 12422054027 is a prime.
It is a super-2 number, since 2×124220540312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12422053992 and 12422054010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12422054231) 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, 2070342336 + ... + 2070342341.
It is an arithmetic number, because the mean of its divisors is an integer number (4140684678).
Almost surely, 212422054031 is an apocalyptic number.
12422054031 is a deficient number, since it is larger than the sum of its proper divisors (4140684681).
12422054031 is an equidigital number, since it uses as much as digits as its factorization.
12422054031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4140684680.
The product of its (nonzero) digits is 1920, while the sum is 24.
Adding to 12422054031 its reverse (13045022421), we get a palindrome (25467076452).
The spelling of 12422054031 in words is "twelve billion, four hundred twenty-two million, fifty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •