Base | Representation |
---|---|
bin | 1111100010101… |
… | …11001100001110 |
3 | 100002100000111120 |
4 | 13301113030032 |
5 | 231334134213 |
6 | 20534301410 |
7 | 3142134150 |
oct | 761271416 |
9 | 302300446 |
10 | 130380558 |
11 | 67661930 |
12 | 377b7866 |
13 | 2101ca79 |
14 | 1345cad0 |
15 | b6a6423 |
hex | 7c5730e |
130380558 has 64 divisors (see below), whose sum is σ = 332716032. Its totient is φ = 33072480.
The previous prime is 130380553. The next prime is 130380577. The reversal of 130380558 is 855083031.
It is a super-3 number, since 3×1303805583 (a number of 25 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130380553) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16585 + ... + 23147.
It is an arithmetic number, because the mean of its divisors is an integer number (5198688).
Almost surely, 2130380558 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 130380558, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166358016).
130380558 is an abundant number, since it is smaller than the sum of its proper divisors (202335474).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130380558 is a wasteful number, since it uses less digits than its factorization.
130380558 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6629.
The product of its (nonzero) digits is 14400, while the sum is 33.
The square root of 130380558 is about 11418.4306277176. The cubic root of 130380558 is about 507.0735356227.
The spelling of 130380558 in words is "one hundred thirty million, three hundred eighty thousand, five hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •