Base | Representation |
---|---|
bin | 110001001011011100… |
… | …1111111110010110011 |
3 | 101002121012201201121222 |
4 | 1202112321333302303 |
5 | 3212242404013021 |
6 | 120303402135255 |
7 | 10426065461015 |
oct | 1422671776263 |
9 | 332535651558 |
10 | 105611001011 |
11 | 4087572521a |
12 | 18574ab152b |
13 | 9c61119299 |
14 | 517c3301b5 |
15 | 2b31b336ab |
hex | 1896e7fcb3 |
105611001011 has 2 divisors, whose sum is σ = 105611001012. Its totient is φ = 105611001010.
The previous prime is 105611000983. The next prime is 105611001043. The reversal of 105611001011 is 110100116501.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 105611001011 - 226 = 105543892147 is a prime.
It is a super-2 number, since 2×1056110010112 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105611001511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52805500505 + 52805500506.
It is an arithmetic number, because the mean of its divisors is an integer number (52805500506).
Almost surely, 2105611001011 is an apocalyptic number.
105611001011 is a deficient number, since it is larger than the sum of its proper divisors (1).
105611001011 is an equidigital number, since it uses as much as digits as its factorization.
105611001011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30, while the sum is 17.
Adding to 105611001011 its reverse (110100116501), we get a palindrome (215711117512).
The spelling of 105611001011 in words is "one hundred five billion, six hundred eleven million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •