Base | Representation |
---|---|
bin | 101110100111100000… |
… | …1110001010110101100 |
3 | 100120101211211121202022 |
4 | 1131033001301112230 |
5 | 3120011142042142 |
6 | 113553455045312 |
7 | 10142551625150 |
oct | 1351701612654 |
9 | 316354747668 |
10 | 100110112172 |
11 | 39502603aa4 |
12 | 1749a810838 |
13 | 9595583b85 |
14 | 4bb9925060 |
15 | 290dc3a6d2 |
hex | 174f0715ac |
100110112172 has 12 divisors (see below), whose sum is σ = 200220224400. Its totient is φ = 42904333776.
The previous prime is 100110112171. The next prime is 100110112177. The reversal of 100110112172 is 271211011001.
100110112172 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 100110112172.
It is not an unprimeable number, because it can be changed into a prime (100110112171) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 1787680547 + ... + 1787680602.
It is an arithmetic number, because the mean of its divisors is an integer number (16685018700).
Almost surely, 2100110112172 is an apocalyptic number.
It is an amenable number.
100110112172 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100110112172 is a wasteful number, since it uses less digits than its factorization.
100110112172 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3575361160 (or 3575361158 counting only the distinct ones).
The product of its (nonzero) digits is 28, while the sum is 17.
Adding to 100110112172 its reverse (271211011001), we get a palindrome (371321123173).
The spelling of 100110112172 in words is "one hundred billion, one hundred ten million, one hundred twelve thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •