Base | Representation |
---|---|
bin | 111100100101010110… |
… | …0100111110001100001 |
3 | 110102211001022001222022 |
4 | 1321022230213301201 |
5 | 4112422132330423 |
6 | 135433530151225 |
7 | 12254024465222 |
oct | 1711254476141 |
9 | 412731261868 |
10 | 130102230113 |
11 | 501a3354129 |
12 | 2126ab82515 |
13 | c36511941b |
14 | 6422cbb249 |
15 | 35b6d08dc8 |
hex | 1e4ab27c61 |
130102230113 has 8 divisors (see below), whose sum is σ = 135556780800. Its totient is φ = 124712230608.
The previous prime is 130102230091. The next prime is 130102230157. The reversal of 130102230113 is 311032201031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130102230113 - 28 = 130102229857 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130102230091 and 130102230100.
It is not an unprimeable number, because it can be changed into a prime (130102230173) 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 7 ways as a sum of consecutive naturals, for example, 16133681 + ... + 16141742.
It is an arithmetic number, because the mean of its divisors is an integer number (16944597600).
Almost surely, 2130102230113 is an apocalyptic number.
It is an amenable number.
130102230113 is a deficient number, since it is larger than the sum of its proper divisors (5454550687).
130102230113 is a wasteful number, since it uses less digits than its factorization.
130102230113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32275591.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 130102230113 its reverse (311032201031), we get a palindrome (441134431144).
The spelling of 130102230113 in words is "one hundred thirty billion, one hundred two million, two hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •