Base | Representation |
---|---|
bin | 1111100111001… |
… | …00010100000000 |
3 | 100010102101102020 |
4 | 13303210110000 |
5 | 232011133332 |
6 | 20554521440 |
7 | 3150062322 |
oct | 763442400 |
9 | 303371366 |
10 | 130958592 |
11 | 67a17146 |
12 | 37a36280 |
13 | 21192bbb |
14 | 1356d612 |
15 | b76c82c |
hex | 7ce4500 |
130958592 has 72 divisors (see below), whose sum is σ = 357127680. Its totient is φ = 42577920.
The previous prime is 130958587. The next prime is 130958593. The reversal of 130958592 is 295859031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130958593) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29409 + ... + 33567.
Almost surely, 2130958592 is an apocalyptic number.
130958592 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 130958592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (178563840).
130958592 is an abundant number, since it is smaller than the sum of its proper divisors (226169088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130958592 is an equidigital number, since it uses as much as digits as its factorization.
130958592 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4219 (or 4205 counting only the distinct ones).
The product of its (nonzero) digits is 97200, while the sum is 42.
The square root of 130958592 is about 11443.7140824122. The cubic root of 130958592 is about 507.8217904673.
The spelling of 130958592 in words is "one hundred thirty million, nine hundred fifty-eight thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •