Base | Representation |
---|---|
bin | 1111100011000… |
… | …01110100000110 |
3 | 100002102020012010 |
4 | 13301201310012 |
5 | 231342032240 |
6 | 20535235050 |
7 | 3142405050 |
oct | 761416406 |
9 | 302366163 |
10 | 130424070 |
11 | 67691597 |
12 | 37818a86 |
13 | 2103680a |
14 | 134708d0 |
15 | b6b4280 |
hex | 7c61d06 |
130424070 has 64 divisors (see below), whose sum is σ = 359064576. Its totient is φ = 29700480.
The previous prime is 130424069. The next prime is 130424081. The reversal of 130424070 is 70424031.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 64312 + ... + 66308.
It is an arithmetic number, because the mean of its divisors is an integer number (5610384).
Almost surely, 2130424070 is an apocalyptic number.
130424070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 130424070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (179532288).
130424070 is an abundant number, since it is smaller than the sum of its proper divisors (228640506).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130424070 is a wasteful number, since it uses less digits than its factorization.
130424070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2325.
The product of its (nonzero) digits is 672, while the sum is 21.
The square root of 130424070 is about 11420.3358094235. The cubic root of 130424070 is about 507.1299380240.
The spelling of 130424070 in words is "one hundred thirty million, four hundred twenty-four thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •