Base | Representation |
---|---|
bin | 110001001011001010… |
… | …0001111110010001001 |
3 | 101002120112002221220021 |
4 | 1202112110033302021 |
5 | 3212232340330113 |
6 | 120302410100441 |
7 | 10425615403534 |
oct | 1422624176211 |
9 | 332515087807 |
10 | 105601105033 |
11 | 40870086226 |
12 | 1857171a721 |
13 | 9c5c062b88 |
14 | 517acb5a1b |
15 | 2b30d2b48d |
hex | 189650fc89 |
105601105033 has 2 divisors, whose sum is σ = 105601105034. Its totient is φ = 105601105032.
The previous prime is 105601105021. The next prime is 105601105109. The reversal of 105601105033 is 330501106501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 105600951369 + 153664 = 324963^2 + 392^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105601105033 is a prime.
It is a super-2 number, since 2×1056011050332 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105601104989 and 105601105007.
It is not a weakly prime, because it can be changed into another prime (105601105013) 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, 52800552516 + 52800552517.
It is an arithmetic number, because the mean of its divisors is an integer number (52800552517).
Almost surely, 2105601105033 is an apocalyptic number.
It is an amenable number.
105601105033 is a deficient number, since it is larger than the sum of its proper divisors (1).
105601105033 is an equidigital number, since it uses as much as digits as its factorization.
105601105033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1350, while the sum is 25.
The spelling of 105601105033 in words is "one hundred five billion, six hundred one million, one hundred five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •