Base | Representation |
---|---|
bin | 110100000111000100… |
… | …0000000000001010000 |
3 | 101200211221010022100122 |
4 | 1220032020000001100 |
5 | 3313140432043302 |
6 | 123224200405412 |
7 | 11041065251543 |
oct | 1501610000120 |
9 | 350757108318 |
10 | 111906127952 |
11 | 43506101273 |
12 | 19831176868 |
13 | a725397a78 |
14 | 55b840485a |
15 | 2d9e6163a2 |
hex | 1a0e200050 |
111906127952 has 80 divisors (see below), whose sum is σ = 238454261760. Its totient is φ = 50639250816.
The previous prime is 111906127951. The next prime is 111906127969. The reversal of 111906127952 is 259721609111.
111906127952 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111906127951) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5744693 + ... + 5764139.
It is an arithmetic number, because the mean of its divisors is an integer number (2980678272).
Almost surely, 2111906127952 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 111906127952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (119227130880).
111906127952 is an abundant number, since it is smaller than the sum of its proper divisors (126548133808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111906127952 is a wasteful number, since it uses less digits than its factorization.
111906127952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20320 (or 20314 counting only the distinct ones).
The product of its (nonzero) digits is 68040, while the sum is 44.
The spelling of 111906127952 in words is "one hundred eleven billion, nine hundred six million, one hundred twenty-seven thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •