Base | Representation |
---|---|
bin | 1111100001010… |
… | …11001011111011 |
3 | 100001222212020220 |
4 | 13300223023323 |
5 | 231312402230 |
6 | 20530351123 |
7 | 3140453520 |
oct | 760531373 |
9 | 301885226 |
10 | 130200315 |
11 | 67549473 |
12 | 3772b4a3 |
13 | 20c88a0b |
14 | 13413147 |
15 | b66cd10 |
hex | 7c2b2fb |
130200315 has 32 divisors (see below), whose sum is σ = 242127360. Its totient is φ = 58508544.
The previous prime is 130200313. The next prime is 130200337. The reversal of 130200315 is 513002031.
It is a happy number.
It is not a de Polignac number, because 130200315 - 21 = 130200313 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a junction number, because it is equal to n+sod(n) for n = 130200294 and 130200303.
It is not an unprimeable number, because it can be changed into a prime (130200313) 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 31 ways as a sum of consecutive naturals, for example, 4314 + ... + 16703.
It is an arithmetic number, because the mean of its divisors is an integer number (7566480).
Almost surely, 2130200315 is an apocalyptic number.
130200315 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
130200315 is a deficient number, since it is larger than the sum of its proper divisors (111927045).
130200315 is a wasteful number, since it uses less digits than its factorization.
130200315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21091.
The product of its (nonzero) digits is 90, while the sum is 15.
The square root of 130200315 is about 11410.5352635185. The cubic root of 130200315 is about 506.8397620046.
Adding to 130200315 its reverse (513002031), we get a palindrome (643202346).
The spelling of 130200315 in words is "one hundred thirty million, two hundred thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •