Base | Representation |
---|---|
bin | 10110100101100011… |
… | …00110010101110101 |
3 | 1011022002111100102201 |
4 | 23102301212111311 |
5 | 144313243331203 |
6 | 5323133304501 |
7 | 606332406661 |
oct | 132261462565 |
9 | 34262440381 |
10 | 12126152053 |
11 | 5162995574 |
12 | 2425035131 |
13 | 11b3333a02 |
14 | 8306998a1 |
15 | 4ae88de1d |
hex | 2d2c66575 |
12126152053 has 2 divisors, whose sum is σ = 12126152054. Its totient is φ = 12126152052.
The previous prime is 12126151991. The next prime is 12126152081. The reversal of 12126152053 is 35025162121.
It is an a-pointer prime, because the next prime (12126152081) can be obtained adding 12126152053 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6899295844 + 5226856209 = 83062^2 + 72297^2 .
It is an emirp because it is prime and its reverse (35025162121) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12126152053 is a prime.
It is a super-2 number, since 2×121261520532 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12126152453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6063076026 + 6063076027.
It is an arithmetic number, because the mean of its divisors is an integer number (6063076027).
Almost surely, 212126152053 is an apocalyptic number.
It is an amenable number.
12126152053 is a deficient number, since it is larger than the sum of its proper divisors (1).
12126152053 is an equidigital number, since it uses as much as digits as its factorization.
12126152053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3600, while the sum is 28.
The spelling of 12126152053 in words is "twelve billion, one hundred twenty-six million, one hundred fifty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.163 sec. • engine limits •