Base | Representation |
---|---|
bin | 111100100101010110… |
… | …0001011001101011001 |
3 | 110102211001002010110222 |
4 | 1321022230023031121 |
5 | 4112422120104423 |
6 | 135433523445425 |
7 | 12254023500140 |
oct | 1711254131531 |
9 | 412731063428 |
10 | 130102113113 |
11 | 501a3284235 |
12 | 2126ab26875 |
13 | c3650a80ab |
14 | 6422c8a757 |
15 | 35b6cd43c8 |
hex | 1e4ab0b359 |
130102113113 has 8 divisors (see below), whose sum is σ = 149305094400. Its totient is φ = 111053373120.
The previous prime is 130102113079. The next prime is 130102113121. The reversal of 130102113113 is 311311201031.
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 130102113113 - 222 = 130097918809 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130102113091 and 130102113100.
It is not an unprimeable number, because it can be changed into a prime (130102113133) 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, 38558513 + ... + 38561886.
It is an arithmetic number, because the mean of its divisors is an integer number (18663136800).
Almost surely, 2130102113113 is an apocalyptic number.
It is an amenable number.
130102113113 is a deficient number, since it is larger than the sum of its proper divisors (19202981287).
130102113113 is an equidigital number, since it uses as much as digits as its factorization.
130102113113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77120647.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 130102113113 its reverse (311311201031), we get a palindrome (441413314144).
The spelling of 130102113113 in words is "one hundred thirty billion, one hundred two million, one hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •