Base | Representation |
---|---|
bin | 110001000101111010… |
… | …0100111011011101101 |
3 | 101002010020210222122002 |
4 | 1202023310213123231 |
5 | 3211402302304013 |
6 | 120233120302045 |
7 | 10421350030646 |
oct | 1421364473355 |
9 | 332106728562 |
10 | 105425041133 |
11 | 4078a761875 |
12 | 18522771925 |
13 | 9c31739759 |
14 | 51617646cd |
15 | 2b2064e358 |
hex | 188bd276ed |
105425041133 has 2 divisors, whose sum is σ = 105425041134. Its totient is φ = 105425041132.
The previous prime is 105425041123. The next prime is 105425041151. The reversal of 105425041133 is 331140524501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 104466643369 + 958397764 = 323213^2 + 30958^2 .
It is a cyclic number.
It is not a de Polignac number, because 105425041133 - 222 = 105420846829 is a prime.
It is a super-2 number, since 2×1054250411332 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105425041096 and 105425041105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105425041103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52712520566 + 52712520567.
It is an arithmetic number, because the mean of its divisors is an integer number (52712520567).
Almost surely, 2105425041133 is an apocalyptic number.
It is an amenable number.
105425041133 is a deficient number, since it is larger than the sum of its proper divisors (1).
105425041133 is an equidigital number, since it uses as much as digits as its factorization.
105425041133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7200, while the sum is 29.
Adding to 105425041133 its reverse (331140524501), we get a palindrome (436565565634).
The spelling of 105425041133 in words is "one hundred five billion, four hundred twenty-five million, forty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •