Base | Representation |
---|---|
bin | 110011101011010011… |
… | …1010011010000110010 |
3 | 101121110000200102010020 |
4 | 1213112213103100302 |
5 | 3304234022343023 |
6 | 122551531144310 |
7 | 11006026212414 |
oct | 1472647232062 |
9 | 347400612106 |
10 | 110974809138 |
11 | 430784286a6 |
12 | 196112a5096 |
13 | a60745704b |
14 | 552a8549b4 |
15 | 2d4799ede3 |
hex | 19d69d3432 |
110974809138 has 8 divisors (see below), whose sum is σ = 221949618288. Its totient is φ = 36991603044.
The previous prime is 110974809091. The next prime is 110974809139. The reversal of 110974809138 is 831908479011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
110974809138 is an admirable number.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (110974809139) 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, 9247900756 + ... + 9247900767.
It is an arithmetic number, because the mean of its divisors is an integer number (27743702286).
Almost surely, 2110974809138 is an apocalyptic number.
110974809138 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.
110974809138 is a wasteful number, since it uses less digits than its factorization.
110974809138 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18495801528.
The product of its (nonzero) digits is 435456, while the sum is 51.
The spelling of 110974809138 in words is "one hundred ten billion, nine hundred seventy-four million, eight hundred nine thousand, one hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •