Base | Representation |
---|---|
bin | 111100101100011011… |
… | …1101100000011000110 |
3 | 110110102121201122201101 |
4 | 1321120313230003012 |
5 | 4113414020342410 |
6 | 135513302450314 |
7 | 12262642552441 |
oct | 1713067540306 |
9 | 413377648641 |
10 | 130340012230 |
11 | 503055a237a |
12 | 2131673399a |
13 | c3a24718bc |
14 | 64466d6658 |
15 | 35ccb27d3a |
hex | 1e58dec0c6 |
130340012230 has 8 divisors (see below), whose sum is σ = 234612022032. Its totient is φ = 52136004888.
The previous prime is 130340012207. The next prime is 130340012233. The reversal of 130340012230 is 32210043031.
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 = 130340012198 and 130340012207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130340012233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6517000602 + ... + 6517000621.
It is an arithmetic number, because the mean of its divisors is an integer number (29326502754).
Almost surely, 2130340012230 is an apocalyptic number.
130340012230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130340012230 is a deficient number, since it is larger than the sum of its proper divisors (104272009802).
130340012230 is a wasteful number, since it uses less digits than its factorization.
130340012230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13034001230.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 130340012230 its reverse (32210043031), we get a palindrome (162550055261).
The spelling of 130340012230 in words is "one hundred thirty billion, three hundred forty million, twelve thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •