Base | Representation |
---|---|
bin | 11000110001110000… |
… | …10101010000011000 |
3 | 1021100001122222120000 |
4 | 30120320111100120 |
5 | 204220343302300 |
6 | 10035550533000 |
7 | 650433605316 |
oct | 143070252030 |
9 | 37301588500 |
10 | 13302322200 |
11 | 57068a5612 |
12 | 26b2b07160 |
13 | 133cc0378b |
14 | 9029850b6 |
15 | 52cc6dc00 |
hex | 318e15418 |
13302322200 has 120 divisors (see below), whose sum is σ = 46200991980. Its totient is φ = 3547281600.
The previous prime is 13302322193. The next prime is 13302322211. The reversal of 13302322200 is 222320331.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (120).
It is a super-2 number, since 2×133023222002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 394366 + ... + 426765.
Almost surely, 213302322200 is an apocalyptic number.
13302322200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13302322200 is an abundant number, since it is smaller than the sum of its proper divisors (32898669780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13302322200 is a wasteful number, since it uses less digits than its factorization.
13302322200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 821159 (or 821141 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 13302322200 its reverse (222320331), we get a palindrome (13524642531).
The spelling of 13302322200 in words is "thirteen billion, three hundred two million, three hundred twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •