| Base | Representation |
|---|---|
| bin | 11000110001100111… |
| … | …01010110111100000 |
| 3 | 1021022222100220000100 |
| 4 | 30120303222313200 |
| 5 | 204220040200000 |
| 6 | 10035504422400 |
| 7 | 650420325126 |
| oct | 143063526740 |
| 9 | 37288326010 |
| 10 | 13301100000 |
| 11 | 5706140331 |
| 12 | 26b2617a00 |
| 13 | 133c896396 |
| 14 | 902747916 |
| 15 | 52cacba00 |
| hex | 318ceade0 |
13301100000 has 216 divisors, whose sum is σ = 47281426920. Its totient is φ = 3546720000.
The previous prime is 13301099963. The next prime is 13301100037. The reversal of 13301100000 is 110331.
13301100000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (13301099963) and next prime (13301100037).
It is a super-2 number, since 2×133011000002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
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 35 ways as a sum of consecutive naturals, for example, 892611 + ... + 907389.
It is an arithmetic number, because the mean of its divisors is an integer number (218895495).
Almost surely, 213301100000 is an apocalyptic number.
13301100000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13301100000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23640713460).
13301100000 is an abundant number, since it is smaller than the sum of its proper divisors (33980326920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13301100000 is an equidigital number, since it uses as much as digits as its factorization.
13301100000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14820 (or 14789 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 9.
Adding to 13301100000 its reverse (110331), we get a palindrome (13301210331).
The spelling of 13301100000 in words is "thirteen billion, three hundred one million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •