Base | Representation |
---|---|
bin | 110100010001110001… |
… | …0110111110101100100 |
3 | 101201202222022222201002 |
4 | 1220203202313311210 |
5 | 3314404431300420 |
6 | 123323555052432 |
7 | 11053020644552 |
oct | 1504342676544 |
9 | 351688288632 |
10 | 112265493860 |
11 | 4367aa43193 |
12 | 199115a1118 |
13 | a781980010 |
14 | 561002cbd2 |
15 | 2dc0e50075 |
hex | 1a238b7d64 |
112265493860 has 48 divisors (see below), whose sum is σ = 268827609456. Its totient is φ = 39013527552.
The previous prime is 112265493829. The next prime is 112265493871. The reversal of 112265493860 is 68394562211.
It can be written as a sum of positive squares in 8 ways, for example, as 6683389504 + 105582104356 = 81752^2 + 324934^2 .
It is a super-2 number, since 2×1122654938602 (a number of 23 digits) contains 22 as substring.
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, 12695297 + ... + 12704136.
It is an arithmetic number, because the mean of its divisors is an integer number (5600575197).
Almost surely, 2112265493860 is an apocalyptic number.
112265493860 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112265493860 is an abundant number, since it is smaller than the sum of its proper divisors (156562115596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112265493860 is a wasteful number, since it uses less digits than its factorization.
112265493860 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25399472 (or 25399470 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 47.
The spelling of 112265493860 in words is "one hundred twelve billion, two hundred sixty-five million, four hundred ninety-three thousand, eight hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •