Base | Representation |
---|---|
bin | 110001001011011110… |
… | …0000001111100110011 |
3 | 101002121020201210221011 |
4 | 1202112330001330303 |
5 | 3212243023043011 |
6 | 120303421411351 |
7 | 10426103141215 |
oct | 1422674017463 |
9 | 332536653834 |
10 | 105611534131 |
11 | 40875a59814 |
12 | 18575109b57 |
13 | 9c61274b3c |
14 | 517c42c5b5 |
15 | 2b31bdb621 |
hex | 1896f01f33 |
105611534131 has 8 divisors (see below), whose sum is σ = 109257166800. Its totient is φ = 101966158560.
The previous prime is 105611534101. The next prime is 105611534183. The reversal of 105611534131 is 131435116501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105611534131 - 215 = 105611501363 is a prime.
It is a super-2 number, since 2×1056115341312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 105611534093 and 105611534102.
It is not an unprimeable number, because it can be changed into a prime (105611534101) 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, 1180021 + ... + 1266361.
It is an arithmetic number, because the mean of its divisors is an integer number (13657145850).
Almost surely, 2105611534131 is an apocalyptic number.
105611534131 is a deficient number, since it is larger than the sum of its proper divisors (3645632669).
105611534131 is an equidigital number, since it uses as much as digits as its factorization.
105611534131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128549.
The product of its (nonzero) digits is 5400, while the sum is 31.
The spelling of 105611534131 in words is "one hundred five billion, six hundred eleven million, five hundred thirty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •