Base | Representation |
---|---|
bin | 10111101001001010… |
… | …01100111011110001 |
3 | 1012202121201212000111 |
4 | 23310211030323301 |
5 | 201443442440401 |
6 | 5455314021321 |
7 | 626360335003 |
oct | 136445147361 |
9 | 35677655014 |
10 | 12693327601 |
11 | 5424063999 |
12 | 2562b77841 |
13 | 12739a8b46 |
14 | 885b3a373 |
15 | 4e4575e51 |
hex | 2f494cef1 |
12693327601 has 2 divisors, whose sum is σ = 12693327602. Its totient is φ = 12693327600.
The previous prime is 12693327599. The next prime is 12693327659. The reversal of 12693327601 is 10672339621.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12691149025 + 2178576 = 112655^2 + 1476^2 .
It is an emirp because it is prime and its reverse (10672339621) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12693327601 - 21 = 12693327599 is a prime.
It is a super-2 number, since 2×126933276012 (a number of 21 digits) contains 22 as substring.
Together with 12693327599, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (12693027601) 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, 6346663800 + 6346663801.
It is an arithmetic number, because the mean of its divisors is an integer number (6346663801).
Almost surely, 212693327601 is an apocalyptic number.
It is an amenable number.
12693327601 is a deficient number, since it is larger than the sum of its proper divisors (1).
12693327601 is an equidigital number, since it uses as much as digits as its factorization.
12693327601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81648, while the sum is 40.
The spelling of 12693327601 in words is "twelve billion, six hundred ninety-three million, three hundred twenty-seven thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •