Base | Representation |
---|---|
bin | 11000100111111110… |
… | …11101000101100000 |
3 | 1021010100022222122021 |
4 | 30103333131011200 |
5 | 204033344200300 |
6 | 10023500551224 |
7 | 645416503006 |
oct | 142377350540 |
9 | 37110288567 |
10 | 13220303200 |
11 | 5674575515 |
12 | 268b552514 |
13 | 1328c17420 |
14 | 8d5b14a76 |
15 | 52596bd1a |
hex | 313fdd160 |
13220303200 has 72 divisors (see below), whose sum is σ = 34756712928. Its totient is φ = 4881338880.
The previous prime is 13220303197. The next prime is 13220303203. The reversal of 13220303200 is 230302231.
It is an interprime number because it is at equal distance from previous prime (13220303197) and next prime (13220303203).
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13220303203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 625192 + ... + 645991.
It is an arithmetic number, because the mean of its divisors is an integer number (482732124).
Almost surely, 213220303200 is an apocalyptic number.
13220303200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13220303200 is an abundant number, since it is smaller than the sum of its proper divisors (21536409728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13220303200 is a wasteful number, since it uses less digits than its factorization.
13220303200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1271216 (or 1271203 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 16.
Adding to 13220303200 its reverse (230302231), we get a palindrome (13450605431).
The spelling of 13220303200 in words is "thirteen billion, two hundred twenty million, three hundred three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •