Base | Representation |
---|---|
bin | 110001001001001100… |
… | …0100011011000110001 |
3 | 101002101220221211100212 |
4 | 1202102120203120301 |
5 | 3212113443000131 |
6 | 120252051553505 |
7 | 10424154522203 |
oct | 1422230433061 |
9 | 332356854325 |
10 | 105535125041 |
11 | 40836910505 |
12 | 185535bb895 |
13 | 9c4b4a1068 |
14 | 517221c773 |
15 | 2b2a146a2b |
hex | 1892623631 |
105535125041 has 4 divisors (see below), whose sum is σ = 105566435184. Its totient is φ = 105503814900.
The previous prime is 105535125013. The next prime is 105535125089. The reversal of 105535125041 is 140521535501.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 105535125041 - 226 = 105468016177 is a prime.
It is a super-2 number, since 2×1055351250412 (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 = 105535124989 and 105535125007.
It is not an unprimeable number, because it can be changed into a prime (105535125011) 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, 15650015 + ... + 15656756.
It is an arithmetic number, because the mean of its divisors is an integer number (26391608796).
Almost surely, 2105535125041 is an apocalyptic number.
It is an amenable number.
105535125041 is a deficient number, since it is larger than the sum of its proper divisors (31310143).
105535125041 is an equidigital number, since it uses as much as digits as its factorization.
105535125041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31310142.
The product of its (nonzero) digits is 15000, while the sum is 32.
The spelling of 105535125041 in words is "one hundred five billion, five hundred thirty-five million, one hundred twenty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •