Base | Representation |
---|---|
bin | 110011001100001000… |
… | …1100101011011110011 |
3 | 101111202010200012022020 |
4 | 1212120101211123303 |
5 | 3300113301212021 |
6 | 122300050242523 |
7 | 10641066323256 |
oct | 1463021453363 |
9 | 344663605266 |
10 | 109928929011 |
11 | 42691018460 |
12 | 1937ab86443 |
13 | a49b874a75 |
14 | 546b9a309d |
15 | 2cd5c597c6 |
hex | 19984656f3 |
109928929011 has 8 divisors (see below), whose sum is σ = 159896624064. Its totient is φ = 66623593320.
The previous prime is 109928929009. The next prime is 109928929037. The reversal of 109928929011 is 110929829901.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 109928929011 - 21 = 109928929009 is a prime.
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 (109928925011) 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 7 ways as a sum of consecutive naturals, for example, 1665589801 + ... + 1665589866.
It is an arithmetic number, because the mean of its divisors is an integer number (19987078008).
Almost surely, 2109928929011 is an apocalyptic number.
109928929011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
109928929011 is a deficient number, since it is larger than the sum of its proper divisors (49967695053).
109928929011 is a wasteful number, since it uses less digits than its factorization.
109928929011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3331179681.
The product of its (nonzero) digits is 209952, while the sum is 51.
The spelling of 109928929011 in words is "one hundred nine billion, nine hundred twenty-eight million, nine hundred twenty-nine thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •