Base | Representation |
---|---|
bin | 10110100111011101… |
… | …11001111101101101 |
3 | 1011100012201211220212 |
4 | 23103232321331231 |
5 | 144331402120323 |
6 | 5324505552205 |
7 | 606616123451 |
oct | 132356717555 |
9 | 34305654825 |
10 | 12142223213 |
11 | 5170a7201a |
12 | 242a4a5665 |
13 | 11b676ca83 |
14 | 832880661 |
15 | 4b0eb5b78 |
hex | 2d3bb9f6d |
12142223213 has 2 divisors, whose sum is σ = 12142223214. Its totient is φ = 12142223212.
The previous prime is 12142223183. The next prime is 12142223243. The reversal of 12142223213 is 31232224121.
It is a balanced prime because it is at equal distance from previous prime (12142223183) and next prime (12142223243).
It can be written as a sum of positive squares in only one way, i.e., 11289700009 + 852523204 = 106253^2 + 29198^2 .
It is a cyclic number.
It is not a de Polignac number, because 12142223213 - 28 = 12142222957 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12142223243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6071111606 + 6071111607.
It is an arithmetic number, because the mean of its divisors is an integer number (6071111607).
Almost surely, 212142223213 is an apocalyptic number.
It is an amenable number.
12142223213 is a deficient number, since it is larger than the sum of its proper divisors (1).
12142223213 is an equidigital number, since it uses as much as digits as its factorization.
12142223213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1152, while the sum is 23.
Adding to 12142223213 its reverse (31232224121), we get a palindrome (43374447334).
The spelling of 12142223213 in words is "twelve billion, one hundred forty-two million, two hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •