Base | Representation |
---|---|
bin | 11101101000100110010000… |
… | …000101101101011100111001 |
3 | 122002110201202210121201122020 |
4 | 131220212100011231130321 |
5 | 114040334343200404423 |
6 | 1141110125010345053 |
7 | 36311156124116226 |
oct | 3550462005553471 |
9 | 562421683551566 |
10 | 130333200013113 |
11 | 38589aaa69a799 |
12 | 1274b544b8b189 |
13 | 57954a2720666 |
14 | 242823673894d |
15 | 10103eb7834e3 |
hex | 76899016d739 |
130333200013113 has 8 divisors (see below), whose sum is σ = 173779879283328. Its totient is φ = 86887660375824.
The previous prime is 130333200013103. The next prime is 130333200013157. The reversal of 130333200013113 is 311310002333031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130333200013113 - 24 = 130333200013097 is a prime.
It is not an unprimeable number, because it can be changed into a prime (130333200013103) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 284641345 + ... + 285098862.
It is an arithmetic number, because the mean of its divisors is an integer number (21722484910416).
Almost surely, 2130333200013113 is an apocalyptic number.
It is an amenable number.
130333200013113 is a deficient number, since it is larger than the sum of its proper divisors (43446679270215).
130333200013113 is an equidigital number, since it uses as much as digits as its factorization.
130333200013113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 569816463.
The product of its (nonzero) digits is 1458, while the sum is 24.
Adding to 130333200013113 its reverse (311310002333031), we get a palindrome (441643202346144).
The spelling of 130333200013113 in words is "one hundred thirty trillion, three hundred thirty-three billion, two hundred million, thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •