Base | Representation |
---|---|
bin | 11000111101011100… |
… | …00110011001100000 |
3 | 1021120220000221012221 |
4 | 30132232012121200 |
5 | 204420434200300 |
6 | 10053411000424 |
7 | 653033461234 |
oct | 143656063140 |
9 | 37526027187 |
10 | 13400303200 |
11 | 5757138149 |
12 | 271b899114 |
13 | 13572bb2bb |
14 | 9119ac5c4 |
15 | 53667531a |
hex | 31eb86660 |
13400303200 has 72 divisors (see below), whose sum is σ = 32902925328. Its totient is φ = 5329082880.
The previous prime is 13400303173. The next prime is 13400303219. The reversal of 13400303200 is 230300431.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 89989 + ... + 186811.
It is an arithmetic number, because the mean of its divisors is an integer number (456985074).
Almost surely, 213400303200 is an apocalyptic number.
13400303200 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 13400303200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16451462664).
13400303200 is an abundant number, since it is smaller than the sum of its proper divisors (19502622128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13400303200 is a wasteful number, since it uses less digits than its factorization.
13400303200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 97016 (or 97003 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 16.
Adding to 13400303200 its reverse (230300431), we get a palindrome (13630603631).
The spelling of 13400303200 in words is "thirteen billion, four hundred million, three hundred three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •