Base | Representation |
---|---|
bin | 11001011110001000111111… |
… | …011010110101100110111000 |
3 | 112200122020101201212001121202 |
4 | 121132020333122311212320 |
5 | 104140333334124423300 |
6 | 1034130214112153332 |
7 | 32411231345511125 |
oct | 3136107732654670 |
9 | 480566351761552 |
10 | 112022401014200 |
11 | 3276a484a55556 |
12 | 10692837538848 |
13 | 4a67889792901 |
14 | 1d93cad91b74c |
15 | ce3e5e132ad5 |
hex | 65e23f6b59b8 |
112022401014200 has 24 divisors (see below), whose sum is σ = 260452082358480. Its totient is φ = 44808960405600.
The previous prime is 112022401014137. The next prime is 112022401014241. The reversal of 112022401014200 is 2410104220211.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 280056002336 + ... + 280056002735.
It is an arithmetic number, because the mean of its divisors is an integer number (10852170098270).
Almost surely, 2112022401014200 is an apocalyptic number.
112022401014200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112022401014200 is an abundant number, since it is smaller than the sum of its proper divisors (148429681344280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112022401014200 is a wasteful number, since it uses less digits than its factorization.
112022401014200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 560112005087 (or 560112005078 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 112022401014200 its reverse (2410104220211), we get a palindrome (114432505234411).
The spelling of 112022401014200 in words is "one hundred twelve trillion, twenty-two billion, four hundred one million, fourteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •