Base | Representation |
---|---|
bin | 11001101111010010110101… |
… | …111010101011010011100000 |
3 | 112211210221002222010202112221 |
4 | 121233102311322223103200 |
5 | 104314142034242024300 |
6 | 1040431530142200424 |
7 | 32562342341510641 |
oct | 3157226572532340 |
9 | 484727088122487 |
10 | 113201210111200 |
11 | 330843aaa5a572 |
12 | 108431a0283114 |
13 | 4b21a9ca45053 |
14 | 1dd4d7991b6c8 |
15 | d1495376231a |
hex | 66f4b5eab4e0 |
113201210111200 has 72 divisors (see below), whose sum is σ = 276387822203472. Its totient is φ = 45274688977920.
The previous prime is 113201210111153. The next prime is 113201210111221. The reversal of 113201210111200 is 2111012102311.
It is a happy number.
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, 2797284 + ... + 15304483.
It is an arithmetic number, because the mean of its divisors is an integer number (3838719752826).
Almost surely, 2113201210111200 is an apocalyptic number.
113201210111200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113201210111200 is an abundant number, since it is smaller than the sum of its proper divisors (163186612092272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113201210111200 is a wasteful number, since it uses less digits than its factorization.
113201210111200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18109604 (or 18109591 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 113201210111200 its reverse (2111012102311), we get a palindrome (115312222213511).
The spelling of 113201210111200 in words is "one hundred thirteen trillion, two hundred one billion, two hundred ten million, one hundred eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •