Base | Representation |
---|---|
bin | 100110110000010… |
… | …1110110101001100 |
3 | 10100121222111012011 |
4 | 1031200232311030 |
5 | 10130402113220 |
6 | 333012351004 |
7 | 44140303423 |
oct | 11540566514 |
9 | 3317874164 |
10 | 1300426060 |
11 | 60806938a |
12 | 303615464 |
13 | 179556b9b |
14 | c49d22ba |
15 | 7927665a |
hex | 4d82ed4c |
1300426060 has 48 divisors (see below), whose sum is σ = 2814944832. Its totient is φ = 504403200.
The previous prime is 1300426027. The next prime is 1300426093. The reversal of 1300426060 is 606240031.
It is an interprime number because it is at equal distance from previous prime (1300426027) and next prime (1300426093).
It is a super-2 number, since 2×13004260602 = 3382215875054247200, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 79114 + ... + 94126.
It is an arithmetic number, because the mean of its divisors is an integer number (58644684).
Almost surely, 21300426060 is an apocalyptic number.
1300426060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1300426060 is an abundant number, since it is smaller than the sum of its proper divisors (1514518772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1300426060 is a wasteful number, since it uses less digits than its factorization.
1300426060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15154 (or 15152 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
The square root of 1300426060 is about 36061.4206597577. The cubic root of 1300426060 is about 1091.5121005128.
Adding to 1300426060 its reverse (606240031), we get a palindrome (1906666091).
The spelling of 1300426060 in words is "one billion, three hundred million, four hundred twenty-six thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •