Base | Representation |
---|---|
bin | 10111101011010100101100… |
… | …001110101010010101111101 |
3 | 111122200221110202001010000121 |
4 | 113223110230032222111331 |
5 | 102122100243334214402 |
6 | 1005245403334454541 |
7 | 30635206405552102 |
oct | 2753245416522575 |
9 | 448627422033017 |
10 | 104132224132477 |
11 | 301a825688a592 |
12 | b819633204451 |
13 | 461481b846c08 |
14 | 1ba0052b7aaa9 |
15 | c08ab89c5837 |
hex | 5eb52c3aa57d |
104132224132477 has 2 divisors, whose sum is σ = 104132224132478. Its totient is φ = 104132224132476.
The previous prime is 104132224132427. The next prime is 104132224132493. The reversal of 104132224132477 is 774231422231401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 65036579604676 + 39095644527801 = 8064526^2 + 6252651^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104132224132477 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104132224132427) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52066112066238 + 52066112066239.
It is an arithmetic number, because the mean of its divisors is an integer number (52066112066239).
Almost surely, 2104132224132477 is an apocalyptic number.
It is an amenable number.
104132224132477 is a deficient number, since it is larger than the sum of its proper divisors (1).
104132224132477 is an equidigital number, since it uses as much as digits as its factorization.
104132224132477 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 451584, while the sum is 43.
Adding to 104132224132477 its reverse (774231422231401), we get a palindrome (878363646363878).
The spelling of 104132224132477 in words is "one hundred four trillion, one hundred thirty-two billion, two hundred twenty-four million, one hundred thirty-two thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •