Base | Representation |
---|---|
bin | 110011001111101011… |
… | …0100011001100110011 |
3 | 101112001102002220211001 |
4 | 1212133112203030303 |
5 | 3300334200433331 |
6 | 122315531302431 |
7 | 10644040525141 |
oct | 1463726431463 |
9 | 345042086731 |
10 | 110047671091 |
11 | 42742050106 |
12 | 193b28aaa17 |
13 | a4ba34b257 |
14 | 547d672591 |
15 | 2ce13b2561 |
hex | 199f5a3333 |
110047671091 has 16 divisors (see below), whose sum is σ = 120455143200. Its totient is φ = 100139010048.
The previous prime is 110047671079. The next prime is 110047671121. The reversal of 110047671091 is 190176740011.
It is not a de Polignac number, because 110047671091 - 25 = 110047671059 is a prime.
It is a super-2 number, since 2×1100476710912 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 110047671091.
It is not an unprimeable number, because it can be changed into a prime (110047671011) 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, 411076 + ... + 623761.
It is an arithmetic number, because the mean of its divisors is an integer number (7528446450).
Almost surely, 2110047671091 is an apocalyptic number.
110047671091 is a deficient number, since it is larger than the sum of its proper divisors (10407472109).
110047671091 is a wasteful number, since it uses less digits than its factorization.
110047671091 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1035078.
The product of its (nonzero) digits is 10584, while the sum is 37.
The spelling of 110047671091 in words is "one hundred ten billion, forty-seven million, six hundred seventy-one thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •