Base | Representation |
---|---|
bin | 11001011111101111010000… |
… | …000001110011011000011000 |
3 | 112201000201210220112001001010 |
4 | 121133233100001303120120 |
5 | 104144133222020031300 |
6 | 1034252453330053520 |
7 | 32422166324011362 |
oct | 3137572001633030 |
9 | 481021726461033 |
10 | 112132201330200 |
11 | 32801aaa409067 |
12 | 106abb7b41a2a0 |
13 | 4a750377b62ac |
14 | 1d993283a1d32 |
15 | ce6c38934a50 |
hex | 65fbd0073618 |
112132201330200 has 96 divisors (see below), whose sum is σ = 347711858588160. Its totient is φ = 29893143196800.
The previous prime is 112132201330141. The next prime is 112132201330351. The reversal of 112132201330200 is 2033102231211.
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 23 ways as a sum of consecutive naturals, for example, 25382716 + ... + 29471115.
It is an arithmetic number, because the mean of its divisors is an integer number (3621998526960).
Almost surely, 2112132201330200 is an apocalyptic number.
112132201330200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112132201330200 is an abundant number, since it is smaller than the sum of its proper divisors (235579657257960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112132201330200 is a wasteful number, since it uses less digits than its factorization.
112132201330200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54857257 (or 54857248 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 112132201330200 its reverse (2033102231211), we get a palindrome (114165303561411).
The spelling of 112132201330200 in words is "one hundred twelve trillion, one hundred thirty-two billion, two hundred one million, three hundred thirty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •