Base | Representation |
---|---|
bin | 111100110011010010… |
… | …1010010100110011110 |
3 | 110111000122121211020110 |
4 | 1321212211102212132 |
5 | 4114401414223210 |
6 | 135552201430450 |
7 | 12301435200162 |
oct | 1714645224636 |
9 | 414018554213 |
10 | 130570070430 |
11 | 50413445518 |
12 | 2137b79b426 |
13 | c40b021507 |
14 | 64690a0ca2 |
15 | 35e2e1d420 |
hex | 1e6695299e |
130570070430 has 32 divisors (see below), whose sum is σ = 329861232000. Its totient is φ = 32986122912.
The previous prime is 130570070429. The next prime is 130570070431. The reversal of 130570070430 is 34070075031.
It is an interprime number because it is at equal distance from previous prime (130570070429) and next prime (130570070431).
It is a super-3 number, since 3×1305700704303 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130570070431) 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, 114534580 + ... + 114535719.
It is an arithmetic number, because the mean of its divisors is an integer number (10308163500).
Almost surely, 2130570070430 is an apocalyptic number.
130570070430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130570070430 is an abundant number, since it is smaller than the sum of its proper divisors (199291161570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130570070430 is a wasteful number, since it uses less digits than its factorization.
130570070430 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 229070328.
The product of its (nonzero) digits is 8820, while the sum is 30.
The spelling of 130570070430 in words is "one hundred thirty billion, five hundred seventy million, seventy thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •