Base | Representation |
---|---|
bin | 10111101011110001… |
… | …01001000111101001 |
3 | 1012211010220010200102 |
4 | 23311320221013221 |
5 | 202020042413001 |
6 | 5501414515145 |
7 | 630044265566 |
oct | 136570510751 |
9 | 35733803612 |
10 | 12715201001 |
11 | 5435443788 |
12 | 256a365ab5 |
13 | 1278396b99 |
14 | 8889d186d |
15 | 4e6446e6b |
hex | 2f5e291e9 |
12715201001 has 2 divisors, whose sum is σ = 12715201002. Its totient is φ = 12715201000.
The previous prime is 12715200989. The next prime is 12715201027. The reversal of 12715201001 is 10010251721.
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., 9667608976 + 3047592025 = 98324^2 + 55205^2 .
It is a cyclic number.
It is not a de Polignac number, because 12715201001 - 210 = 12715199977 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (12715201201) 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, 6357600500 + 6357600501.
It is an arithmetic number, because the mean of its divisors is an integer number (6357600501).
Almost surely, 212715201001 is an apocalyptic number.
It is an amenable number.
12715201001 is a deficient number, since it is larger than the sum of its proper divisors (1).
12715201001 is an equidigital number, since it uses as much as digits as its factorization.
12715201001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 140, while the sum is 20.
Adding to 12715201001 its reverse (10010251721), we get a palindrome (22725452722).
The spelling of 12715201001 in words is "twelve billion, seven hundred fifteen million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •