Base | Representation |
---|---|
bin | 10100101011101100… |
… | …11100101100111111 |
3 | 1001122212011022102011 |
4 | 22111312130230333 |
5 | 140220111404434 |
6 | 5033501312051 |
7 | 542111361043 |
oct | 122566345477 |
9 | 31585138364 |
10 | 11104013119 |
11 | 4788a20451 |
12 | 219a865627 |
13 | 107c644984 |
14 | 774a28023 |
15 | 44ec87e64 |
hex | 295d9cb3f |
11104013119 has 2 divisors, whose sum is σ = 11104013120. Its totient is φ = 11104013118.
The previous prime is 11104013111. The next prime is 11104013201. The reversal of 11104013119 is 91131040111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11104013119 - 23 = 11104013111 is a prime.
It is a super-2 number, since 2×111040131192 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11104013119.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11104013111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5552006559 + 5552006560.
It is an arithmetic number, because the mean of its divisors is an integer number (5552006560).
Almost surely, 211104013119 is an apocalyptic number.
11104013119 is a deficient number, since it is larger than the sum of its proper divisors (1).
11104013119 is an equidigital number, since it uses as much as digits as its factorization.
11104013119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 22.
The spelling of 11104013119 in words is "eleven billion, one hundred four million, thirteen thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •