Base | Representation |
---|---|
bin | 1111100100011… |
… | …10000010110101 |
3 | 100002202102201000 |
4 | 13302032002311 |
5 | 231413331422 |
6 | 20543153513 |
7 | 3144061200 |
oct | 762160265 |
9 | 302672630 |
10 | 130605237 |
11 | 677a5714 |
12 | 378a5899 |
13 | 2109b109 |
14 | 134ba937 |
15 | b6eccac |
hex | 7c8e0b5 |
130605237 has 48 divisors (see below), whose sum is σ = 238360320. Its totient is φ = 70229376.
The previous prime is 130605229. The next prime is 130605239. The reversal of 130605237 is 732506031.
It is a happy number.
130605237 is a `hidden beast` number, since 1 + 30 + 605 + 23 + 7 = 666.
It is not a de Polignac number, because 130605237 - 23 = 130605229 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 130605237.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130605239) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 19588 + ... + 25394.
It is an arithmetic number, because the mean of its divisors is an integer number (4965840).
Almost surely, 2130605237 is an apocalyptic number.
130605237 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
130605237 is a deficient number, since it is larger than the sum of its proper divisors (107755083).
130605237 is a wasteful number, since it uses less digits than its factorization.
130605237 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5847 (or 5834 counting only the distinct ones).
The product of its (nonzero) digits is 3780, while the sum is 27.
The square root of 130605237 is about 11428.2648289231. The cubic root of 130605237 is about 507.3646408724.
The spelling of 130605237 in words is "one hundred thirty million, six hundred five thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •