Base | Representation |
---|---|
bin | 110100001101001111… |
… | …0001001111111001000 |
3 | 101201101100212211120220 |
4 | 1220122132021333020 |
5 | 3314101443400121 |
6 | 123300520150040 |
7 | 11046162002502 |
oct | 1503236117710 |
9 | 351340784526 |
10 | 112113262536 |
11 | 43602017580 |
12 | 1988a608320 |
13 | a75927c602 |
14 | 55d7b22d72 |
15 | 2db28ce6c6 |
hex | 1a1a789fc8 |
112113262536 has 64 divisors (see below), whose sum is σ = 315626803200. Its totient is φ = 32877787200.
The previous prime is 112113262529. The next prime is 112113262577. The reversal of 112113262536 is 635262311211.
It is a super-2 number, since 2×1121132625362 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 112113262497 and 112113262506.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6841356 + ... + 6857723.
It is an arithmetic number, because the mean of its divisors is an integer number (4931668800).
Almost surely, 2112113262536 is an apocalyptic number.
It is an amenable number.
112113262536 is an abundant number, since it is smaller than the sum of its proper divisors (203513540664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112113262536 is a wasteful number, since it uses less digits than its factorization.
112113262536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13699130 (or 13699126 counting only the distinct ones).
The product of its digits is 12960, while the sum is 33.
Adding to 112113262536 its reverse (635262311211), we get a palindrome (747375573747).
The spelling of 112113262536 in words is "one hundred twelve billion, one hundred thirteen million, two hundred sixty-two thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •