Base | Representation |
---|---|
bin | 11001100110101010100110… |
… | …111010111100001001010000 |
3 | 112202201020120202210022100121 |
4 | 121212222212322330021100 |
5 | 104224433200234110323 |
6 | 1035255303422200024 |
7 | 32501451325515466 |
oct | 3146524672741120 |
9 | 482636522708317 |
10 | 112608253035088 |
11 | 3297598a168a28 |
12 | 10768298123014 |
13 | 4aaabb326c135 |
14 | 1db43a8ba8836 |
15 | d042ebd8ba5d |
hex | 666aa6ebc250 |
112608253035088 has 20 divisors (see below), whose sum is σ = 220427753044660. Its totient is φ = 55723671604224.
The previous prime is 112608253035071. The next prime is 112608253035101. The reversal of 112608253035088 is 880530352806211.
It can be written as a sum of positive squares in 2 ways, for example, as 20288286079504 + 92319966955584 = 4504252^2 + 9608328^2 .
It is a super-2 number, since 2×1126082530350882 (a number of 29 digits) contains 22 as substring.
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 3 ways as a sum of consecutive naturals, for example, 36278430483 + ... + 36278433586.
It is an arithmetic number, because the mean of its divisors is an integer number (11021387652233).
Almost surely, 2112608253035088 is an apocalyptic number.
It is an amenable number.
112608253035088 is a deficient number, since it is larger than the sum of its proper divisors (107819500009572).
112608253035088 is an equidigital number, since it uses as much as digits as its factorization.
112608253035088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72556864174 (or 72556864168 counting only the distinct ones).
The product of its (nonzero) digits is 2764800, while the sum is 52.
The spelling of 112608253035088 in words is "one hundred twelve trillion, six hundred eight billion, two hundred fifty-three million, thirty-five thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •