Base | Representation |
---|---|
bin | 10111101001011101… |
… | …10010011100011001 |
3 | 1012202210110112010012 |
4 | 23310232302130121 |
5 | 202000113344122 |
6 | 5455443531305 |
7 | 626420602232 |
oct | 136456623431 |
9 | 35683415105 |
10 | 12695840537 |
11 | 542551a9a6 |
12 | 2563989b35 |
13 | 12743788a3 |
14 | 8861d2089 |
15 | 4e48c07e2 |
hex | 2f4bb2719 |
12695840537 has 2 divisors, whose sum is σ = 12695840538. Its totient is φ = 12695840536.
The previous prime is 12695840447. The next prime is 12695840543. The reversal of 12695840537 is 73504859621.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11787662041 + 908178496 = 108571^2 + 30136^2 .
It is an emirp because it is prime and its reverse (73504859621) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12695840537 - 220 = 12694791961 is a prime.
It is a super-2 number, since 2×126958405372 (a number of 21 digits) contains 22 as substring.
It is a weakly prime.
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, 6347920268 + 6347920269.
It is an arithmetic number, because the mean of its divisors is an integer number (6347920269).
It is a 2-persistent number, because it is pandigital, and so is 2⋅12695840537 = 25391681074, but 3⋅12695840537 = 38087521611 is not.
Almost surely, 212695840537 is an apocalyptic number.
It is an amenable number.
12695840537 is a deficient number, since it is larger than the sum of its proper divisors (1).
12695840537 is an equidigital number, since it uses as much as digits as its factorization.
12695840537 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1814400, while the sum is 50.
The spelling of 12695840537 in words is "twelve billion, six hundred ninety-five million, eight hundred forty thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •