Base | Representation |
---|---|
bin | 100110110011010… |
… | …1111010101110101 |
3 | 10100201221111121202 |
4 | 1031212233111311 |
5 | 10131303013023 |
6 | 333110222245 |
7 | 44156553215 |
oct | 11546572565 |
9 | 3321844552 |
10 | 1302001013 |
11 | 608a446a5 |
12 | 304054985 |
13 | 179988a01 |
14 | c4cc2245 |
15 | 79488128 |
hex | 4d9af575 |
1302001013 has 2 divisors, whose sum is σ = 1302001014. Its totient is φ = 1302001012.
The previous prime is 1302001007. The next prime is 1302001033. The reversal of 1302001013 is 3101002031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 884289169 + 417711844 = 29737^2 + 20438^2 .
It is a cyclic number.
It is not a de Polignac number, because 1302001013 - 28 = 1302000757 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1302000985 and 1302001003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1302001033) 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, 651000506 + 651000507.
It is an arithmetic number, because the mean of its divisors is an integer number (651000507).
Almost surely, 21302001013 is an apocalyptic number.
It is an amenable number.
1302001013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1302001013 is an equidigital number, since it uses as much as digits as its factorization.
1302001013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 11.
The square root of 1302001013 is about 36083.2511423236. The cubic root of 1302001013 is about 1091.9525681362.
Adding to 1302001013 its reverse (3101002031), we get a palindrome (4403003044).
The spelling of 1302001013 in words is "one billion, three hundred two million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •