Base | Representation |
---|---|
bin | 100111000110101… |
… | …0101110011001101 |
3 | 10101102222121021112 |
4 | 1032031111303031 |
5 | 10141400320023 |
6 | 334111141405 |
7 | 44341556531 |
oct | 11615256315 |
9 | 3342877245 |
10 | 1312120013 |
11 | 613726206 |
12 | 307514865 |
13 | 17babc799 |
14 | c6397bc1 |
15 | 7a2d6478 |
hex | 4e355ccd |
1312120013 has 2 divisors, whose sum is σ = 1312120014. Its totient is φ = 1312120012.
The previous prime is 1312120003. The next prime is 1312120021. The reversal of 1312120013 is 3100212131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1296144004 + 15976009 = 36002^2 + 3997^2 .
It is a cyclic number.
It is not a de Polignac number, because 1312120013 - 24 = 1312119997 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1312120013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1312120003) 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, 656060006 + 656060007.
It is an arithmetic number, because the mean of its divisors is an integer number (656060007).
Almost surely, 21312120013 is an apocalyptic number.
It is an amenable number.
1312120013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1312120013 is an equidigital number, since it uses as much as digits as its factorization.
1312120013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 1312120013 is about 36223.1971670089. The cubic root of 1312120013 is about 1094.7741137996.
Adding to 1312120013 its reverse (3100212131), we get a palindrome (4412332144).
The spelling of 1312120013 in words is "one billion, three hundred twelve million, one hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •