Base | Representation |
---|---|
bin | 1111100110001… |
… | …01000011000100 |
3 | 100010011212202021 |
4 | 13303011003010 |
5 | 231443034112 |
6 | 20552052524 |
7 | 3146020060 |
oct | 763050304 |
9 | 303155667 |
10 | 130830532 |
11 | 67939a08 |
12 | 37994144 |
13 | 21149821 |
14 | 13538aa0 |
15 | b744907 |
hex | 7cc50c4 |
130830532 has 48 divisors (see below), whose sum is σ = 274563072. Its totient is φ = 53333280.
The previous prime is 130830461. The next prime is 130830533. The reversal of 130830532 is 235038031.
It is a junction number, because it is equal to n+sod(n) for n = 130830497 and 130830506.
It is not an unprimeable number, because it can be changed into a prime (130830533) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 143157 + ... + 144067.
It is an arithmetic number, because the mean of its divisors is an integer number (5720064).
Almost surely, 2130830532 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 130830532, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (137281536).
130830532 is an abundant number, since it is smaller than the sum of its proper divisors (143732540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130830532 is a wasteful number, since it uses less digits than its factorization.
130830532 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1168 (or 1166 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 130830532 is about 11438.1175024564. The cubic root of 130830532 is about 507.6562092037.
Adding to 130830532 its reverse (235038031), we get a palindrome (365868563).
The spelling of 130830532 in words is "one hundred thirty million, eight hundred thirty thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •