Base | Representation |
---|---|
bin | 111100100101100111… |
… | …1101101111001010110 |
3 | 110102211200121111011101 |
4 | 1321023033231321112 |
5 | 4112432011231410 |
6 | 135434455300314 |
7 | 12254165623555 |
oct | 1711317557126 |
9 | 412750544141 |
10 | 130111430230 |
11 | 501a8568331 |
12 | 2127207a69a |
13 | c366cbab92 |
14 | 64241d3d9c |
15 | 35b7a24d3a |
hex | 1e4b3ede56 |
130111430230 has 8 divisors (see below), whose sum is σ = 234200574432. Its totient is φ = 52044572088.
The previous prime is 130111430167. The next prime is 130111430249. The reversal of 130111430230 is 32034111031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 130111430198 and 130111430207.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6505571502 + ... + 6505571521.
It is an arithmetic number, because the mean of its divisors is an integer number (29275071804).
Almost surely, 2130111430230 is an apocalyptic number.
130111430230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130111430230 is a deficient number, since it is larger than the sum of its proper divisors (104089144202).
130111430230 is a wasteful number, since it uses less digits than its factorization.
130111430230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13011143030.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 130111430230 its reverse (32034111031), we get a palindrome (162145541261).
The spelling of 130111430230 in words is "one hundred thirty billion, one hundred eleven million, four hundred thirty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •