Base | Representation |
---|---|
bin | 1111100100100… |
… | …01010000101101 |
3 | 100002210002210000 |
4 | 13302101100231 |
5 | 231414242123 |
6 | 20543334513 |
7 | 3144144462 |
oct | 762212055 |
9 | 302702700 |
10 | 130618413 |
11 | 67804602 |
12 | 378b1439 |
13 | 210a4103 |
14 | 134c1669 |
15 | b701b43 |
hex | 7c9142d |
130618413 has 20 divisors (see below), whose sum is σ = 195497280. Its totient is φ = 86911272.
The previous prime is 130618373. The next prime is 130618427. The reversal of 130618413 is 314816031.
130618413 is a `hidden beast` number, since 1 + 3 + 0 + 618 + 41 + 3 = 666.
It is not a de Polignac number, because 130618413 - 29 = 130617901 is a prime.
It is a super-2 number, since 2×1306184132 = 34122339629277138, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130628413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 52156 + ... + 54602.
It is an arithmetic number, because the mean of its divisors is an integer number (9774864).
Almost surely, 2130618413 is an apocalyptic number.
It is an amenable number.
130618413 is a deficient number, since it is larger than the sum of its proper divisors (64878867).
130618413 is an equidigital number, since it uses as much as digits as its factorization.
130618413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3118 (or 3109 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The square root of 130618413 is about 11428.8412798499. The cubic root of 130618413 is about 507.3817019844.
The spelling of 130618413 in words is "one hundred thirty million, six hundred eighteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •