Base | Representation |
---|---|
bin | 100110111001101… |
… | …0110101010100101 |
3 | 10100222011111200211 |
4 | 1031303112222211 |
5 | 10133124322223 |
6 | 333305135421 |
7 | 44226635065 |
oct | 11563265245 |
9 | 3328144624 |
10 | 1305307813 |
11 | 60a8a3097 |
12 | 30518a571 |
13 | 17a575bb4 |
14 | c55033a5 |
15 | 798dcd0d |
hex | 4dcd6aa5 |
1305307813 has 8 divisors (see below), whose sum is σ = 1312484600. Its totient is φ = 1298151360.
The previous prime is 1305307811. The next prime is 1305307837. The reversal of 1305307813 is 3187035031.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 313183809 + 992124004 = 17697^2 + 31498^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1305307813 - 21 = 1305307811 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1305307811) 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 7 ways as a sum of consecutive naturals, for example, 133843 + ... + 143263.
It is an arithmetic number, because the mean of its divisors is an integer number (164060575).
Almost surely, 21305307813 is an apocalyptic number.
It is an amenable number.
1305307813 is a deficient number, since it is larger than the sum of its proper divisors (7176787).
1305307813 is an equidigital number, since it uses as much as digits as its factorization.
1305307813 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10167.
The product of its (nonzero) digits is 7560, while the sum is 31.
The square root of 1305307813 is about 36129.0438982268. The cubic root of 1305307813 is about 1092.8762274578.
The spelling of 1305307813 in words is "one billion, three hundred five million, three hundred seven thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •