Base | Representation |
---|---|
bin | 1111100010001… |
… | …00000001010000 |
3 | 100002012000210012 |
4 | 13301010001100 |
5 | 231324131112 |
6 | 20532454052 |
7 | 3141356210 |
oct | 761040120 |
9 | 302160705 |
10 | 130302032 |
11 | 67608933 |
12 | 3777a328 |
13 | 20cc30c3 |
14 | 1343c240 |
15 | b68d022 |
hex | 7c44050 |
130302032 has 80 divisors (see below), whose sum is σ = 296980992. Its totient is φ = 54238080.
The previous prime is 130302023. The next prime is 130302077. The reversal of 130302032 is 230203031.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 130301998 and 130302016.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 994607 + ... + 994737.
Almost surely, 2130302032 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 130302032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (148490496).
130302032 is an abundant number, since it is smaller than the sum of its proper divisors (166678960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130302032 is a wasteful number, since it uses less digits than its factorization.
130302032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336 (or 330 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 14.
The square root of 130302032 is about 11414.9915462080. The cubic root of 130302032 is about 506.9717145799.
Adding to 130302032 its reverse (230203031), we get a palindrome (360505063).
Subtracting 130302032 from its reverse (230203031), we obtain a palindrome (99900999).
The spelling of 130302032 in words is "one hundred thirty million, three hundred two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •