Base | Representation |
---|---|
bin | 10111010110001011… |
… | …11110000001010111 |
3 | 1012100112012112200201 |
4 | 23223011332001113 |
5 | 201132220120421 |
6 | 5431430121331 |
7 | 622415322055 |
oct | 135305760127 |
9 | 35315175621 |
10 | 12534145111 |
11 | 535221a814 |
12 | 25197b0247 |
13 | 1249a13517 |
14 | 86c9411d5 |
15 | 4d55d0b91 |
hex | 2eb17e057 |
12534145111 has 2 divisors, whose sum is σ = 12534145112. Its totient is φ = 12534145110.
The previous prime is 12534145109. The next prime is 12534145139. The reversal of 12534145111 is 11154143521.
It is a happy number.
It is an a-pointer prime, because the next prime (12534145139) can be obtained adding 12534145111 to its sum of digits (28).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 12534145111 - 21 = 12534145109 is a prime.
Together with 12534145109, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 12534145111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12534145171) 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, 6267072555 + 6267072556.
It is an arithmetic number, because the mean of its divisors is an integer number (6267072556).
Almost surely, 212534145111 is an apocalyptic number.
12534145111 is a deficient number, since it is larger than the sum of its proper divisors (1).
12534145111 is an equidigital number, since it uses as much as digits as its factorization.
12534145111 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2400, while the sum is 28.
Adding to 12534145111 its reverse (11154143521), we get a palindrome (23688288632).
The spelling of 12534145111 in words is "twelve billion, five hundred thirty-four million, one hundred forty-five thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •