Base | Representation |
---|---|
bin | 100111100000001… |
… | …1000101001011001 |
3 | 10102101011102120021 |
4 | 1033000120221121 |
5 | 10203312013032 |
6 | 335310030441 |
7 | 44563400311 |
oct | 11700305131 |
9 | 3371142507 |
10 | 1325501017 |
11 | 620235595 |
12 | 30baa8421 |
13 | 1817c6239 |
14 | c807c441 |
15 | 7b57b097 |
hex | 4f018a59 |
1325501017 has 6 divisors (see below), whose sum is σ = 1385637722. Its totient is φ = 1267870032.
The previous prime is 1325501011. The next prime is 1325501027. The reversal of 1325501017 is 7101055231.
It can be written as a sum of positive squares in only one way, i.e., 1078728336 + 246772681 = 32844^2 + 15709^2 .
It is a de Polignac number, because none of the positive numbers 2k-1325501017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1325500982 and 1325501000.
It is not an unprimeable number, because it can be changed into a prime (1325501011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1252308 + ... + 1253365.
Almost surely, 21325501017 is an apocalyptic number.
It is an amenable number.
1325501017 is a deficient number, since it is larger than the sum of its proper divisors (60136705).
1325501017 is an equidigital number, since it uses as much as digits as its factorization.
1325501017 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2505719 (or 2505696 counting only the distinct ones).
The product of its (nonzero) digits is 1050, while the sum is 25.
The square root of 1325501017 is about 36407.4307937267. The cubic root of 1325501017 is about 1098.4830376347.
Adding to 1325501017 its reverse (7101055231), we get a palindrome (8426556248).
The spelling of 1325501017 in words is "one billion, three hundred twenty-five million, five hundred one thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.299 sec. • engine limits •