Base | Representation |
---|---|
bin | 110001001001101100… |
… | …1001000001100110001 |
3 | 101002110002210212012211 |
4 | 1202103121020030301 |
5 | 3212132311144131 |
6 | 120253454452121 |
7 | 10424451435031 |
oct | 1422331101461 |
9 | 332402725184 |
10 | 105552053041 |
11 | 40845422796 |
12 | 18559204041 |
13 | 9c51b4a126 |
14 | 51745878c1 |
15 | 2b2b88c5b1 |
hex | 1893648331 |
105552053041 has 2 divisors, whose sum is σ = 105552053042. Its totient is φ = 105552053040.
The previous prime is 105552053039. The next prime is 105552053093. The reversal of 105552053041 is 140350255501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 101063589025 + 4488464016 = 317905^2 + 66996^2 .
It is an emirp because it is prime and its reverse (140350255501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 105552053041 - 21 = 105552053039 is a prime.
It is a super-2 number, since 2×1055520530412 (a number of 23 digits) contains 22 as substring.
Together with 105552053039, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 105552052994 and 105552053012.
It is not a weakly prime, because it can be changed into another prime (105552053441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52776026520 + 52776026521.
It is an arithmetic number, because the mean of its divisors is an integer number (52776026521).
Almost surely, 2105552053041 is an apocalyptic number.
It is an amenable number.
105552053041 is a deficient number, since it is larger than the sum of its proper divisors (1).
105552053041 is an equidigital number, since it uses as much as digits as its factorization.
105552053041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15000, while the sum is 31.
The spelling of 105552053041 in words is "one hundred five billion, five hundred fifty-two million, fifty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •