Base | Representation |
---|---|
bin | 1111100011101… |
… | …01110110010011 |
3 | 100002120101202102 |
4 | 13301311312103 |
5 | 231402144011 |
6 | 20541111015 |
7 | 3143166230 |
oct | 761656623 |
9 | 302511672 |
10 | 130506131 |
11 | 67738208 |
12 | 3785846b |
13 | 21064c82 |
14 | 13492787 |
15 | b6cd73b |
hex | 7c75d93 |
130506131 has 4 divisors (see below), whose sum is σ = 149149872. Its totient is φ = 111862392.
The previous prime is 130506083. The next prime is 130506133. The reversal of 130506131 is 131605031.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 131605031 = 9173 ⋅14347.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130506131 is a prime.
It is a super-2 number, since 2×1305061312 = 34063700457178322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130506133) 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 3 ways as a sum of consecutive naturals, for example, 9321860 + ... + 9321873.
It is an arithmetic number, because the mean of its divisors is an integer number (37287468).
Almost surely, 2130506131 is an apocalyptic number.
130506131 is a deficient number, since it is larger than the sum of its proper divisors (18643741).
130506131 is an equidigital number, since it uses as much as digits as its factorization.
130506131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18643740.
The product of its (nonzero) digits is 270, while the sum is 20.
The square root of 130506131 is about 11423.9280022241. The cubic root of 130506131 is about 507.2362754123.
The spelling of 130506131 in words is "one hundred thirty million, five hundred six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •