Base | Representation |
---|---|
bin | 11000110001101000… |
… | …11011101110100010 |
3 | 1021022222202001112120 |
4 | 30120310123232202 |
5 | 204220113101010 |
6 | 10035513005110 |
7 | 650422120446 |
oct | 143064335642 |
9 | 37288661476 |
10 | 13301300130 |
11 | 5706267728 |
12 | 26b26b3796 |
13 | 133c9364c1 |
14 | 90279a826 |
15 | 52cb1ae70 |
hex | 318d1bba2 |
13301300130 has 64 divisors (see below), whose sum is σ = 32161079808. Its totient is φ = 3520661760.
The previous prime is 13301300101. The next prime is 13301300137. The reversal of 13301300130 is 3100310331.
13301300130 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (13301300137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2733900 + ... + 2738760.
It is an arithmetic number, because the mean of its divisors is an integer number (502516872).
Almost surely, 213301300130 is an apocalyptic number.
13301300130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13301300130 is an abundant number, since it is smaller than the sum of its proper divisors (18859779678).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13301300130 is a wasteful number, since it uses less digits than its factorization.
13301300130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5531.
The product of its (nonzero) digits is 81, while the sum is 15.
Adding to 13301300130 its reverse (3100310331), we get a palindrome (16401610461).
The spelling of 13301300130 in words is "thirteen billion, three hundred one million, three hundred thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •