Base | Representation |
---|---|
bin | 1100001100001110010100… |
… | …1111101010011111101000 |
3 | 1202110102102211211120012010 |
4 | 3003003211033222133220 |
5 | 3224103141334132300 |
6 | 44301440114115520 |
7 | 2552263120354266 |
oct | 303034517523750 |
9 | 52412384746163 |
10 | 13404144052200 |
11 | 42a8735965920 |
12 | 160599087bba0 |
13 | 76300ba13a45 |
14 | 344a9a719436 |
15 | 183a14caca50 |
hex | c30e53ea7e8 |
13404144052200 has 192 divisors, whose sum is σ = 45558173376000. Its totient is φ = 3233160057600.
The previous prime is 13404144052183. The next prime is 13404144052223. The reversal of 13404144052200 is 225044140431.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3789442 + ... + 6416241.
It is an arithmetic number, because the mean of its divisors is an integer number (237282153000).
Almost surely, 213404144052200 is an apocalyptic number.
13404144052200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13404144052200 is an abundant number, since it is smaller than the sum of its proper divisors (32154029323800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13404144052200 is a wasteful number, since it uses less digits than its factorization.
13404144052200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10205912 (or 10205903 counting only the distinct ones).
The product of its (nonzero) digits is 15360, while the sum is 30.
Adding to 13404144052200 its reverse (225044140431), we get a palindrome (13629188192631).
The spelling of 13404144052200 in words is "thirteen trillion, four hundred four billion, one hundred forty-four million, fifty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •