Base | Representation |
---|---|
bin | 110001000011110100… |
… | …1111100110000111001 |
3 | 101001221101021102220012 |
4 | 1202013221330300321 |
5 | 3211231403323212 |
6 | 120222142111305 |
7 | 10416540611033 |
oct | 1420751746071 |
9 | 331841242805 |
10 | 105355136057 |
11 | 40754256086 |
12 | 1850327b535 |
13 | 9c201021c2 |
14 | 5156368c53 |
15 | 2b19441922 |
hex | 1887a7cc39 |
105355136057 has 2 divisors, whose sum is σ = 105355136058. Its totient is φ = 105355136056.
The previous prime is 105355136011. The next prime is 105355136071. The reversal of 105355136057 is 750631553501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104675543296 + 679592761 = 323536^2 + 26069^2 .
It is a cyclic number.
It is not a de Polignac number, because 105355136057 - 218 = 105354873913 is a prime.
It is a super-2 number, since 2×1053551360572 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105355136357) 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 as a sum of consecutive naturals, namely, 52677568028 + 52677568029.
It is an arithmetic number, because the mean of its divisors is an integer number (52677568029).
Almost surely, 2105355136057 is an apocalyptic number.
It is an amenable number.
105355136057 is a deficient number, since it is larger than the sum of its proper divisors (1).
105355136057 is an equidigital number, since it uses as much as digits as its factorization.
105355136057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 236250, while the sum is 41.
Adding to 105355136057 its reverse (750631553501), we get a palindrome (855986689558).
The spelling of 105355136057 in words is "one hundred five billion, three hundred fifty-five million, one hundred thirty-six thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •