Base | Representation |
---|---|
bin | 11001101111100110011111… |
… | …000010000101010011010000 |
3 | 112211212221112211101121000110 |
4 | 121233212133002011103100 |
5 | 104320013233024410300 |
6 | 1040445335041321320 |
7 | 32564020111306101 |
oct | 3157463702052320 |
9 | 484787484347013 |
10 | 113222301013200 |
11 | 3309234324a395 |
12 | 108472a7636240 |
13 | 4b23a81436512 |
14 | 1dd5dbaa543a8 |
15 | d1528a168550 |
hex | 66f99f0854d0 |
113222301013200 has 60 divisors (see below), whose sum is σ = 362688770916128. Its totient is φ = 30192613603200.
The previous prime is 113222301013181. The next prime is 113222301013229. The reversal of 113222301013200 is 2310103222311.
It is a tau number, because it is divible by the number of its divisors (60).
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 47175957556 + ... + 47175959955.
Almost surely, 2113222301013200 is an apocalyptic number.
113222301013200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113222301013200 is an abundant number, since it is smaller than the sum of its proper divisors (249466469902928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113222301013200 is a wasteful number, since it uses less digits than its factorization.
113222301013200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94351917532 (or 94351917521 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 113222301013200 its reverse (2310103222311), we get a palindrome (115532404235511).
The spelling of 113222301013200 in words is "one hundred thirteen trillion, two hundred twenty-two billion, three hundred one million, thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •