Base | Representation |
---|---|
bin | 110100011100011100… |
… | …0000101100100011100 |
3 | 101202200220202022121220 |
4 | 1220320320011210130 |
5 | 3321123041023133 |
6 | 123423301453340 |
7 | 11064624622635 |
oct | 1507070054434 |
9 | 352626668556 |
10 | 112623376668 |
11 | 43843a61900 |
12 | 199b1411250 |
13 | a80ab661aa |
14 | 564578c88c |
15 | 2de25945b3 |
hex | 1a38e0591c |
112623376668 has 72 divisors (see below), whose sum is σ = 288979107984. Its totient is φ = 34112981760.
The previous prime is 112623376661. The next prime is 112623376709. The reversal of 112623376668 is 866673326211.
It is a self number, because there is not a number n which added to its sum of digits gives 112623376668.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112623376661) 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, 3458430 + ... + 3490842.
It is an arithmetic number, because the mean of its divisors is an integer number (4013598722).
Almost surely, 2112623376668 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 112623376668, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (144489553992).
112623376668 is an abundant number, since it is smaller than the sum of its proper divisors (176355731316).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112623376668 is a wasteful number, since it uses less digits than its factorization.
112623376668 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34835 (or 34822 counting only the distinct ones).
The product of its digits is 2612736, while the sum is 51.
The spelling of 112623376668 in words is "one hundred twelve billion, six hundred twenty-three million, three hundred seventy-six thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •