Base | Representation |
---|---|
bin | 100111000010111… |
… | …0000101100100001 |
3 | 10101022020122122101 |
4 | 1032011300230201 |
5 | 10140343224100 |
6 | 334000410401 |
7 | 44315642545 |
oct | 11605605441 |
9 | 3338218571 |
10 | 1310133025 |
11 | 612599373 |
12 | 306916a01 |
13 | 17b575256 |
14 | c5ddba25 |
15 | 7a04286a |
hex | 4e170b21 |
1310133025 has 12 divisors (see below), whose sum is σ = 1629178092. Its totient is φ = 1045130240.
The previous prime is 1310133007. The next prime is 1310133031. The reversal of 1310133025 is 5203310131.
It can be written as a sum of positive squares in 6 ways, for example, as 6345361 + 1303787664 = 2519^2 + 36108^2 .
It is a de Polignac number, because none of the positive numbers 2k-1310133025 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1310132993 and 1310133011.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 65404 + ... + 83053.
It is an arithmetic number, because the mean of its divisors is an integer number (135764841).
Almost surely, 21310133025 is an apocalyptic number.
It is an amenable number.
1310133025 is a deficient number, since it is larger than the sum of its proper divisors (319045067).
1310133025 is a wasteful number, since it uses less digits than its factorization.
1310133025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148820 (or 148815 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 19.
The square root of 1310133025 is about 36195.7597654753. The cubic root of 1310133025 is about 1094.2212167132.
Adding to 1310133025 its reverse (5203310131), we get a palindrome (6513443156).
The spelling of 1310133025 in words is "one billion, three hundred ten million, one hundred thirty-three thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •