Base | Representation |
---|---|
bin | 10111101010000001… |
… | …00011000000111101 |
3 | 1012210010020001010021 |
4 | 23311000203000331 |
5 | 202002311332213 |
6 | 5500131412141 |
7 | 626505301636 |
oct | 136500430075 |
9 | 35703201107 |
10 | 12700495933 |
11 | 542810a634 |
12 | 2565454051 |
13 | 1275318868 |
14 | 886a8488d |
15 | 4e4eded8d |
hex | 2f502303d |
12700495933 has 2 divisors, whose sum is σ = 12700495934. Its totient is φ = 12700495932.
The previous prime is 12700495931. The next prime is 12700495943. The reversal of 12700495933 is 33959400721.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9531031129 + 3169464804 = 97627^2 + 56298^2 .
It is an emirp because it is prime and its reverse (33959400721) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12700495933 - 21 = 12700495931 is a prime.
It is a super-2 number, since 2×127004959332 (a number of 21 digits) contains 22 as substring.
Together with 12700495931, 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 12700495933.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12700495931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6350247966 + 6350247967.
It is an arithmetic number, because the mean of its divisors is an integer number (6350247967).
Almost surely, 212700495933 is an apocalyptic number.
It is an amenable number.
12700495933 is a deficient number, since it is larger than the sum of its proper divisors (1).
12700495933 is an equidigital number, since it uses as much as digits as its factorization.
12700495933 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 204120, while the sum is 43.
The spelling of 12700495933 in words is "twelve billion, seven hundred million, four hundred ninety-five thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •