Base | Representation |
---|---|
bin | 1011110100101101010000… |
… | …1000110010111001101010 |
3 | 1201000210121102022221221022 |
4 | 2331023110020302321222 |
5 | 3200443231302110010 |
6 | 43352102145212442 |
7 | 2511141225503066 |
oct | 275132410627152 |
9 | 51023542287838 |
10 | 13000130113130 |
11 | 4162362599706 |
12 | 155b619331122 |
13 | 733ba3913534 |
14 | 32d2d1414aa6 |
15 | 17826acd8d55 |
hex | bd2d4232e6a |
13000130113130 has 8 divisors (see below), whose sum is σ = 23400234203652. Its totient is φ = 5200052045248.
The previous prime is 13000130113073. The next prime is 13000130113153. The reversal of 13000130113130 is 3131103100031.
13000130113130 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 12935294185489 + 64835927641 = 3596567^2 + 254629^2 .
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 = 13000130113099 and 13000130113108.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 650006505647 + ... + 650006505666.
Almost surely, 213000130113130 is an apocalyptic number.
13000130113130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13000130113130 is a deficient number, since it is larger than the sum of its proper divisors (10400104090522).
13000130113130 is a wasteful number, since it uses less digits than its factorization.
13000130113130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1300013011320.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 13000130113130 its reverse (3131103100031), we get a palindrome (16131233213161).
The spelling of 13000130113130 in words is "thirteen trillion, one hundred thirty million, one hundred thirteen thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •