Base | Representation |
---|---|
bin | 10110010110100010… |
… | …01000101111110001 |
3 | 1010222022111102001022 |
4 | 23023101020233301 |
5 | 144034022423323 |
6 | 5302433545225 |
7 | 603243013553 |
oct | 131321105761 |
9 | 33868442038 |
10 | 12000201713 |
11 | 50a888a185 |
12 | 23aaa15215 |
13 | 1193205596 |
14 | 81ba714d3 |
15 | 4a37b04c8 |
hex | 2cb448bf1 |
12000201713 has 2 divisors, whose sum is σ = 12000201714. Its totient is φ = 12000201712.
The previous prime is 12000201709. The next prime is 12000201721. The reversal of 12000201713 is 31710200021.
12000201713 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6170573809 + 5829627904 = 78553^2 + 76352^2 .
It is a cyclic number.
It is not a de Polignac number, because 12000201713 - 22 = 12000201709 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12000201691 and 12000201700.
It is not a weakly prime, because it can be changed into another prime (12000201413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6000100856 + 6000100857.
It is an arithmetic number, because the mean of its divisors is an integer number (6000100857).
Almost surely, 212000201713 is an apocalyptic number.
It is an amenable number.
12000201713 is a deficient number, since it is larger than the sum of its proper divisors (1).
12000201713 is an equidigital number, since it uses as much as digits as its factorization.
12000201713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 17.
Adding to 12000201713 its reverse (31710200021), we get a palindrome (43710401734).
The spelling of 12000201713 in words is "twelve billion, two hundred one thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •