Base | Representation |
---|---|
bin | 110100011010010110… |
… | …0000010101000100010 |
3 | 101202112000112101221120 |
4 | 1220310230002220202 |
5 | 3321002044010200 |
6 | 123412311433110 |
7 | 11063112435663 |
oct | 1506454025042 |
9 | 352460471846 |
10 | 112553110050 |
11 | 43808329517 |
12 | 19991985796 |
13 | a7c9433204 |
14 | 563a2db36a |
15 | 2ddb3149a0 |
hex | 1a34b02a22 |
112553110050 has 48 divisors (see below), whose sum is σ = 279860659200. Its totient is φ = 29935781440.
The previous prime is 112553110001. The next prime is 112553110057. The reversal of 112553110050 is 50011355211.
It is a super-2 number, since 2×1125531100502 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 112553110050.
It is not an unprimeable number, because it can be changed into a prime (112553110057) 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, 922125 + ... + 1037024.
It is an arithmetic number, because the mean of its divisors is an integer number (5830430400).
Almost surely, 2112553110050 is an apocalyptic number.
112553110050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112553110050 is an abundant number, since it is smaller than the sum of its proper divisors (167307549150).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112553110050 is a wasteful number, since it uses less digits than its factorization.
112553110050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1959547 (or 1959542 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 24.
Adding to 112553110050 its reverse (50011355211), we get a palindrome (162564465261).
The spelling of 112553110050 in words is "one hundred twelve billion, five hundred fifty-three million, one hundred ten thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •