Base | Representation |
---|---|
bin | 1111100011101… |
… | …11111010101000 |
3 | 100002120211101002 |
4 | 13301313322220 |
5 | 231402431400 |
6 | 20541214132 |
7 | 3143233016 |
oct | 761677250 |
9 | 302524332 |
10 | 130514600 |
11 | 67743607 |
12 | 37861348 |
13 | 21068a98 |
14 | 134958b6 |
15 | b6d0ed5 |
hex | 7c77ea8 |
130514600 has 24 divisors (see below), whose sum is σ = 303446910. Its totient is φ = 52205760.
The previous prime is 130514599. The next prime is 130514609. The reversal of 130514600 is 6415031.
It can be written as a sum of positive squares in 3 ways, for example, as 100681156 + 29833444 = 10034^2 + 5462^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (130514609) 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 5 ways as a sum of consecutive naturals, for example, 326087 + ... + 326486.
Almost surely, 2130514600 is an apocalyptic number.
130514600 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130514600 is an abundant number, since it is smaller than the sum of its proper divisors (172932310).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130514600 is a wasteful number, since it uses less digits than its factorization.
130514600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 652589 (or 652580 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 20.
The square root of 130514600 is about 11424.2986655637. The cubic root of 130514600 is about 507.2472472879.
Adding to 130514600 its reverse (6415031), we get a palindrome (136929631).
The spelling of 130514600 in words is "one hundred thirty million, five hundred fourteen thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •