Base | Representation |
---|---|
bin | 110100100011001000… |
… | …1100101000000100010 |
3 | 101210021120201122022001 |
4 | 1221012101211000202 |
5 | 3322103112202400 |
6 | 123501451434214 |
7 | 11103324362143 |
oct | 1510621450042 |
9 | 353246648261 |
10 | 112848162850 |
11 | 43949934005 |
12 | 19a5475596a |
13 | a8455bb277 |
14 | 5667583aca |
15 | 2e07197a6a |
hex | 1a46465022 |
112848162850 has 24 divisors (see below), whose sum is σ = 209907078480. Its totient is φ = 45137223120.
The previous prime is 112848162841. The next prime is 112848162857. The reversal of 112848162850 is 58261848211.
It is a happy number.
112848162850 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 112848162850.
It is not an unprimeable number, because it can be changed into a prime (112848162857) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1583281 + ... + 1653019.
It is an arithmetic number, because the mean of its divisors is an integer number (8746128270).
Almost surely, 2112848162850 is an apocalyptic number.
112848162850 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112848162850 is a deficient number, since it is larger than the sum of its proper divisors (97058915630).
112848162850 is a wasteful number, since it uses less digits than its factorization.
112848162850 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102114 (or 102109 counting only the distinct ones).
The product of its (nonzero) digits is 245760, while the sum is 46.
The spelling of 112848162850 in words is "one hundred twelve billion, eight hundred forty-eight million, one hundred sixty-two thousand, eight hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •