Base | Representation |
---|---|
bin | 111100101000010001… |
… | …0000011001010011101 |
3 | 110110001212111111102020 |
4 | 1321100202003022131 |
5 | 4113122212401023 |
6 | 135451344250353 |
7 | 12256323530313 |
oct | 1712042031235 |
9 | 413055444366 |
10 | 130200122013 |
11 | 50243635825 |
12 | 212979109b9 |
13 | c37c4a2520 |
14 | 6431cc00b3 |
15 | 35c06e3de3 |
hex | 1e5088329d |
130200122013 has 8 divisors (see below), whose sum is σ = 186954021408. Its totient is φ = 80123151984.
The previous prime is 130200121993. The next prime is 130200122023. The reversal of 130200122013 is 310221002031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130200122013 - 26 = 130200121949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130200121983 and 130200122001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130200122023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1669232295 + ... + 1669232372.
It is an arithmetic number, because the mean of its divisors is an integer number (23369252676).
Almost surely, 2130200122013 is an apocalyptic number.
130200122013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
130200122013 is a deficient number, since it is larger than the sum of its proper divisors (56753899395).
130200122013 is a wasteful number, since it uses less digits than its factorization.
130200122013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3338464683.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 130200122013 its reverse (310221002031), we get a palindrome (440421124044).
The spelling of 130200122013 in words is "one hundred thirty billion, two hundred million, one hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •