Base | Representation |
---|---|
bin | 110100001110101011… |
… | …0110011010000000010 |
3 | 101201111201221222201122 |
4 | 1220131112303100002 |
5 | 3314201341303200 |
6 | 123305405432242 |
7 | 11050320300560 |
oct | 1503526632002 |
9 | 351451858648 |
10 | 112161666050 |
11 | 43627377885 |
12 | 198a286b682 |
13 | a7662c9145 |
14 | 5600322a30 |
15 | 2db6c91385 |
hex | 1a1d5b3402 |
112161666050 has 48 divisors (see below), whose sum is σ = 242922255552. Its totient is φ = 37729848000.
The previous prime is 112161666017. The next prime is 112161666059. The reversal of 112161666050 is 50666161211.
It is a super-2 number, since 2×1121616660502 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a self number, because there is not a number n which added to its sum of digits gives 112161666050.
It is not an unprimeable number, because it can be changed into a prime (112161666059) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3004676 + ... + 3041775.
It is an arithmetic number, because the mean of its divisors is an integer number (5060880324).
Almost surely, 2112161666050 is an apocalyptic number.
112161666050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112161666050 is an abundant number, since it is smaller than the sum of its proper divisors (130760589502).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112161666050 is a wasteful number, since it uses less digits than its factorization.
112161666050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6046523 (or 6046518 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 35.
The spelling of 112161666050 in words is "one hundred twelve billion, one hundred sixty-one million, six hundred sixty-six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •