Base | Representation |
---|---|
bin | 100110111001100… |
… | …1000110000011000 |
3 | 10100222001121112201 |
4 | 1031303020300120 |
5 | 10133121011330 |
6 | 333304015544 |
7 | 44226310015 |
oct | 11563106030 |
9 | 3328047481 |
10 | 1305250840 |
11 | 60a864303 |
12 | 3051615b4 |
13 | 17a555c9a |
14 | c54ca70c |
15 | 798caeca |
hex | 4dcc8c18 |
1305250840 has 16 divisors (see below), whose sum is σ = 2936814480. Its totient is φ = 522100320.
The previous prime is 1305250831. The next prime is 1305250873. The reversal of 1305250840 is 480525031.
It is a junction number, because it is equal to n+sod(n) for n = 1305250799 and 1305250808.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 16315596 + ... + 16315675.
It is an arithmetic number, because the mean of its divisors is an integer number (183550905).
Almost surely, 21305250840 is an apocalyptic number.
1305250840 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1305250840 is an abundant number, since it is smaller than the sum of its proper divisors (1631563640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1305250840 is a wasteful number, since it uses less digits than its factorization.
1305250840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32631282 (or 32631278 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 28.
The square root of 1305250840 is about 36128.2554242521. The cubic root of 1305250840 is about 1092.8603269061.
Adding to 1305250840 its reverse (480525031), we get a palindrome (1785775871).
The spelling of 1305250840 in words is "one billion, three hundred five million, two hundred fifty thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •