Base | Representation |
---|---|
bin | 100110111001101… |
… | …0110011110101101 |
3 | 10100222011110122200 |
4 | 1031303112132231 |
5 | 10133124311203 |
6 | 333305132113 |
7 | 44226632631 |
oct | 11563263655 |
9 | 3328143580 |
10 | 1305307053 |
11 | 60a8a2566 |
12 | 30518a039 |
13 | 17a57574b |
14 | c5502dc1 |
15 | 798dc9a3 |
hex | 4dcd67ad |
1305307053 has 36 divisors (see below), whose sum is σ = 1963457340. Its totient is φ = 835014528.
The previous prime is 1305307051. The next prime is 1305307147. The reversal of 1305307053 is 3507035031.
1305307053 is a `hidden beast` number, since 1 + 305 + 307 + 0 + 53 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 709849449 + 595457604 = 26643^2 + 24402^2 .
It is not a de Polignac number, because 1305307053 - 21 = 1305307051 is a prime.
It is a super-2 number, since 2×13053070532 = 3407653005223089618, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1305307051) 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 in 35 ways as a sum of consecutive naturals, for example, 2293753 + ... + 2294321.
Almost surely, 21305307053 is an apocalyptic number.
It is an amenable number.
1305307053 is a deficient number, since it is larger than the sum of its proper divisors (658150287).
1305307053 is an equidigital number, since it uses as much as digits as its factorization.
1305307053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 778 (or 692 counting only the distinct ones).
The product of its (nonzero) digits is 4725, while the sum is 27.
The square root of 1305307053 is about 36129.0333803715. The cubic root of 1305307053 is about 1092.8760153530.
The spelling of 1305307053 in words is "one billion, three hundred five million, three hundred seven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •