Base | Representation |
---|---|
bin | 110001001001001111… |
… | …0010000100111010011 |
3 | 101002102000202211110011 |
4 | 1202102132100213103 |
5 | 3212114333333021 |
6 | 120252144015351 |
7 | 10424203322503 |
oct | 1422236204723 |
9 | 332360684404 |
10 | 105536621011 |
11 | 40837742448 |
12 | 18554001557 |
13 | 9c4b8a5c53 |
14 | 51724cba03 |
15 | 2b2a33ede1 |
hex | 18927909d3 |
105536621011 has 2 divisors, whose sum is σ = 105536621012. Its totient is φ = 105536621010.
The previous prime is 105536620901. The next prime is 105536621077. The reversal of 105536621011 is 110126635501.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 105536621011 - 215 = 105536588243 is a prime.
It is a super-2 number, since 2×1055366210112 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105536621111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52768310505 + 52768310506.
It is an arithmetic number, because the mean of its divisors is an integer number (52768310506).
Almost surely, 2105536621011 is an apocalyptic number.
105536621011 is a deficient number, since it is larger than the sum of its proper divisors (1).
105536621011 is an equidigital number, since it uses as much as digits as its factorization.
105536621011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5400, while the sum is 31.
The spelling of 105536621011 in words is "one hundred five billion, five hundred thirty-six million, six hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •