Base | Representation |
---|---|
bin | 110011100001111110… |
… | …0100001011010111011 |
3 | 101120122012022222212212 |
4 | 1213003330201122323 |
5 | 3303113332330201 |
6 | 122500502125335 |
7 | 10665204060104 |
oct | 1470374413273 |
9 | 346565288785 |
10 | 110661605051 |
11 | 42a27655848 |
12 | 1954442084b |
13 | a5875b519a |
14 | 54db0053ab |
15 | 2d2a233abb |
hex | 19c3f216bb |
110661605051 has 4 divisors (see below), whose sum is σ = 110663836704. Its totient is φ = 110659373400.
The previous prime is 110661605027. The next prime is 110661605081. The reversal of 110661605051 is 150506166011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 150506166011 = 17 ⋅8853303883.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110661605051 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110661604999 and 110661605017.
It is not an unprimeable number, because it can be changed into a prime (110661605081) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1039715 + ... + 1141196.
It is an arithmetic number, because the mean of its divisors is an integer number (27665959176).
Almost surely, 2110661605051 is an apocalyptic number.
110661605051 is a deficient number, since it is larger than the sum of its proper divisors (2231653).
110661605051 is an equidigital number, since it uses as much as digits as its factorization.
110661605051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2231652.
The product of its (nonzero) digits is 5400, while the sum is 32.
The spelling of 110661605051 in words is "one hundred ten billion, six hundred sixty-one million, six hundred five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •