Base | Representation |
---|---|
bin | 10100101011110110… |
… | …01011110011100111 |
3 | 1001122221111101110002 |
4 | 22111323023303213 |
5 | 140220421122011 |
6 | 5033544051515 |
7 | 542125051442 |
oct | 122573136347 |
9 | 31587441402 |
10 | 11105254631 |
11 | 4789699199 |
12 | 219b163b9b |
13 | 107c98aab3 |
14 | 774c6c659 |
15 | 44ee30c3b |
hex | 295ecbce7 |
11105254631 has 2 divisors, whose sum is σ = 11105254632. Its totient is φ = 11105254630.
The previous prime is 11105254619. The next prime is 11105254639. The reversal of 11105254631 is 13645250111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11105254631 - 230 = 10031512807 is a prime.
It is a super-2 number, since 2×111052546312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11105254594 and 11105254603.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11105254639) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5552627315 + 5552627316.
It is an arithmetic number, because the mean of its divisors is an integer number (5552627316).
Almost surely, 211105254631 is an apocalyptic number.
11105254631 is a deficient number, since it is larger than the sum of its proper divisors (1).
11105254631 is an equidigital number, since it uses as much as digits as its factorization.
11105254631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 29.
The spelling of 11105254631 in words is "eleven billion, one hundred five million, two hundred fifty-four thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •