Base | Representation |
---|---|
bin | 1111100100100… |
… | …00110011001011 |
3 | 100002210000012000 |
4 | 13302100303023 |
5 | 231414212043 |
6 | 20543322043 |
7 | 3144136122 |
oct | 762206313 |
9 | 302700160 |
10 | 130616523 |
11 | 67803144 |
12 | 378b0323 |
13 | 210a32ab |
14 | 134c0ab9 |
15 | b7012d3 |
hex | 7c90ccb |
130616523 has 8 divisors (see below), whose sum is σ = 193506000. Its totient is φ = 87077664.
The previous prime is 130616509. The next prime is 130616537. The reversal of 130616523 is 325616031.
130616523 is a `hidden beast` number, since 1 + 3 + 0 + 6 + 1 + 652 + 3 = 666.
It is an interprime number because it is at equal distance from previous prime (130616509) and next prime (130616537).
It is not a de Polignac number, because 130616523 - 28 = 130616267 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 4837649 = 130616523 / (1 + 3 + 0 + 6 + 1 + 6 + 5 + 2 + 3).
It is not an unprimeable number, because it can be changed into a prime (130616503) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2418798 + ... + 2418851.
It is an arithmetic number, because the mean of its divisors is an integer number (24188250).
Almost surely, 2130616523 is an apocalyptic number.
130616523 is a deficient number, since it is larger than the sum of its proper divisors (62889477).
130616523 is an equidigital number, since it uses as much as digits as its factorization.
130616523 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4837658 (or 4837652 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
The square root of 130616523 is about 11428.7585940031. The cubic root of 130616523 is about 507.3792547642.
The spelling of 130616523 in words is "one hundred thirty million, six hundred sixteen thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •