Base | Representation |
---|---|
bin | 10110110001011000… |
… | …10110101100010011 |
3 | 1011120000022201121202 |
4 | 23120230112230103 |
5 | 200014203044111 |
6 | 5341041341415 |
7 | 611646346523 |
oct | 133054265423 |
9 | 34500281552 |
10 | 12225440531 |
11 | 5203a40467 |
12 | 245233786b |
13 | 11caa886a5 |
14 | 83d943683 |
15 | 4b8452b3b |
hex | 2d8b16b13 |
12225440531 has 2 divisors, whose sum is σ = 12225440532. Its totient is φ = 12225440530.
The previous prime is 12225440501. The next prime is 12225440543. The reversal of 12225440531 is 13504452221.
12225440531 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12225440531 - 230 = 11151698707 is a prime.
It is a super-2 number, since 2×122254405312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12225440494 and 12225440503.
It is not a weakly prime, because it can be changed into another prime (12225440501) 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 as a sum of consecutive naturals, namely, 6112720265 + 6112720266.
It is an arithmetic number, because the mean of its divisors is an integer number (6112720266).
Almost surely, 212225440531 is an apocalyptic number.
12225440531 is a deficient number, since it is larger than the sum of its proper divisors (1).
12225440531 is an equidigital number, since it uses as much as digits as its factorization.
12225440531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9600, while the sum is 29.
Adding to 12225440531 its reverse (13504452221), we get a palindrome (25729892752).
The spelling of 12225440531 in words is "twelve billion, two hundred twenty-five million, four hundred forty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •