Base | Representation |
---|---|
bin | 10110100111101101… |
… | …00100101100101101 |
3 | 1011100100111222012002 |
4 | 23103312210230231 |
5 | 144332410431021 |
6 | 5325021022045 |
7 | 606642164606 |
oct | 132366445455 |
9 | 34310458162 |
10 | 12144233261 |
11 | 5172115216 |
12 | 242b0b4925 |
13 | 11b6cc4954 |
14 | 832c44dad |
15 | 4b126150b |
hex | 2d3da4b2d |
12144233261 has 2 divisors, whose sum is σ = 12144233262. Its totient is φ = 12144233260.
The previous prime is 12144233219. The next prime is 12144233263. The reversal of 12144233261 is 16233244121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11240028361 + 904204900 = 106019^2 + 30070^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12144233261 is a prime.
It is a Sophie Germain prime.
Together with 12144233263, it forms a pair of twin primes.
It is a Chen 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 (12144233263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6072116630 + 6072116631.
It is an arithmetic number, because the mean of its divisors is an integer number (6072116631).
Almost surely, 212144233261 is an apocalyptic number.
It is an amenable number.
12144233261 is a deficient number, since it is larger than the sum of its proper divisors (1).
12144233261 is an equidigital number, since it uses as much as digits as its factorization.
12144233261 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6912, while the sum is 29.
Adding to 12144233261 its reverse (16233244121), we get a palindrome (28377477382).
The spelling of 12144233261 in words is "twelve billion, one hundred forty-four million, two hundred thirty-three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •