Base | Representation |
---|---|
bin | 1111100011100… |
… | …10011100110111 |
3 | 100002112200200000 |
4 | 13301302130313 |
5 | 231401222330 |
6 | 20540522343 |
7 | 3143110530 |
oct | 761623467 |
9 | 302480600 |
10 | 130492215 |
11 | 67728807 |
12 | 378503b3 |
13 | 2105b839 |
14 | 1348b687 |
15 | b6c9560 |
hex | 7c72737 |
130492215 has 96 divisors (see below), whose sum is σ = 273262080. Its totient is φ = 58506624.
The previous prime is 130492213. The next prime is 130492223. The reversal of 130492215 is 512294031.
It is not a de Polignac number, because 130492215 - 21 = 130492213 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130492211) 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 95 ways as a sum of consecutive naturals, for example, 569721 + ... + 569949.
It is an arithmetic number, because the mean of its divisors is an integer number (2846480).
Almost surely, 2130492215 is an apocalyptic number.
130492215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
130492215 is an abundant number, since it is smaller than the sum of its proper divisors (142769865).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130492215 is an equidigital number, since it uses as much as digits as its factorization.
130492215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 323 (or 311 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 130492215 is about 11423.3189135207. The cubic root of 130492215 is about 507.2182457334.
The spelling of 130492215 in words is "one hundred thirty million, four hundred ninety-two thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •