Base | Representation |
---|---|
bin | 100110110101010… |
… | …0011011110101001 |
3 | 10100210211022100100 |
4 | 1031222203132221 |
5 | 10132032013001 |
6 | 333143500013 |
7 | 44201216511 |
oct | 11552433651 |
9 | 3323738310 |
10 | 1303001001 |
11 | 609567a35 |
12 | 304457609 |
13 | 179c48c13 |
14 | c50a2841 |
15 | 795d4586 |
hex | 4daa37a9 |
1303001001 has 12 divisors (see below), whose sum is σ = 1947013380. Its totient is φ = 838713120.
The previous prime is 1303000987. The next prime is 1303001009. The reversal of 1303001001 is 1001003031.
It can be written as a sum of positive squares in 2 ways, for example, as 971942976 + 331058025 = 31176^2 + 18195^2 .
It is not a de Polignac number, because 1303001001 - 25 = 1303000969 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (1303001009) 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 in 11 ways as a sum of consecutive naturals, for example, 2495910 + ... + 2496431.
It is an arithmetic number, because the mean of its divisors is an integer number (162251115).
Almost surely, 21303001001 is an apocalyptic number.
It is an amenable number.
1303001001 is a deficient number, since it is larger than the sum of its proper divisors (644012379).
1303001001 is a wasteful number, since it uses less digits than its factorization.
1303001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4992376 (or 4992373 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 9.
The square root of 1303001001 is about 36097.1051609405. The cubic root of 1303001001 is about 1092.2320507741.
Adding to 1303001001 its reverse (1001003031), we get a palindrome (2304004032).
The spelling of 1303001001 in words is "one billion, three hundred three million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •