Base | Representation |
---|---|
bin | 1111100010100… |
… | …11000101000000 |
3 | 100002022011101122 |
4 | 13301103011000 |
5 | 231333114322 |
6 | 20534051412 |
7 | 3142034063 |
oct | 761230500 |
9 | 302264348 |
10 | 130363712 |
11 | 67650206 |
12 | 377a9b68 |
13 | 210151bb |
14 | 134568da |
15 | b6a1442 |
hex | 7c53140 |
130363712 has 56 divisors (see below), whose sum is σ = 278221440. Its totient is φ = 60410880.
The previous prime is 130363703. The next prime is 130363721. The reversal of 130363712 is 217363031.
It is an interprime number because it is at equal distance from previous prime (130363703) and next prime (130363721).
It is a congruent number.
It is an unprimeable number.
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, 56012 + ... + 58292.
It is an arithmetic number, because the mean of its divisors is an integer number (4968240).
Almost surely, 2130363712 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 130363712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (139110720).
130363712 is an abundant number, since it is smaller than the sum of its proper divisors (147857728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130363712 is a wasteful number, since it uses less digits than its factorization.
130363712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2359 (or 2349 counting only the distinct ones).
The product of its (nonzero) digits is 2268, while the sum is 26.
The square root of 130363712 is about 11417.6929368415. The cubic root of 130363712 is about 507.0516956366.
The spelling of 130363712 in words is "one hundred thirty million, three hundred sixty-three thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •