Base | Representation |
---|---|
bin | 1111100011101… |
… | …10110101111000 |
3 | 100002120121100010 |
4 | 13301312311320 |
5 | 231402311300 |
6 | 20541141520 |
7 | 3143214132 |
oct | 761666570 |
9 | 302517303 |
10 | 130510200 |
11 | 67740277 |
12 | 3785a8a0 |
13 | 21066a92 |
14 | 13494052 |
15 | b6cea50 |
hex | 7c76d78 |
130510200 has 48 divisors (see below), whose sum is σ = 404583480. Its totient is φ = 34802560.
The previous prime is 130510199. The next prime is 130510201. The reversal of 130510200 is 2015031.
It is an interprime number because it is at equal distance from previous prime (130510199) and next prime (130510201).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130510201) 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 11 ways as a sum of consecutive naturals, for example, 108159 + ... + 109358.
Almost surely, 2130510200 is an apocalyptic number.
130510200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130510200 is an abundant number, since it is smaller than the sum of its proper divisors (274073280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130510200 is a wasteful number, since it uses less digits than its factorization.
130510200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217536 (or 217527 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 12.
The square root of 130510200 is about 11424.1060919443. The cubic root of 130510200 is about 507.2415469985.
Adding to 130510200 its reverse (2015031), we get a palindrome (132525231).
The spelling of 130510200 in words is "one hundred thirty million, five hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •