Base | Representation |
---|---|
bin | 111100101110111100… |
… | …0001100010000000011 |
3 | 110110122110211012201110 |
4 | 1321131320030100003 |
5 | 4114102022431321 |
6 | 135525503334403 |
7 | 12265012652016 |
oct | 1713570142003 |
9 | 413573735643 |
10 | 130424030211 |
11 | 50348a68322 |
12 | 2133a8b1403 |
13 | c3b69aaa97 |
14 | 645392737d |
15 | 35d51c2176 |
hex | 1e5de0c403 |
130424030211 has 8 divisors (see below), whose sum is σ = 179508342784. Its totient is φ = 84144535560.
The previous prime is 130424030171. The next prime is 130424030251. The reversal of 130424030211 is 112030424031.
It is an interprime number because it is at equal distance from previous prime (130424030171) and next prime (130424030251).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130424030211 - 26 = 130424030147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130424030251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 701204371 + ... + 701204556.
It is an arithmetic number, because the mean of its divisors is an integer number (22438542848).
Almost surely, 2130424030211 is an apocalyptic number.
130424030211 is a deficient number, since it is larger than the sum of its proper divisors (49084312573).
130424030211 is a wasteful number, since it uses less digits than its factorization.
130424030211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1402408961.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 130424030211 its reverse (112030424031), we get a palindrome (242454454242).
The spelling of 130424030211 in words is "one hundred thirty billion, four hundred twenty-four million, thirty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •