Base | Representation |
---|---|
bin | 111001110010000110111010… |
… | …110111101111000101101101 |
3 | 1020022210210020212110200012022 |
4 | 321302012322313233011231 |
5 | 231302144422102004442 |
6 | 2300254353204115525 |
7 | 104346302143000541 |
oct | 7162067267570555 |
9 | 1208723225420168 |
10 | 254132055109997 |
11 | 73a7988799a749 |
12 | 246045b3095ba5 |
13 | aba571c38370c |
14 | 46a80b2959a21 |
15 | 1e5a8581693d2 |
hex | e721badef16d |
254132055109997 has 2 divisors, whose sum is σ = 254132055109998. Its totient is φ = 254132055109996.
The previous prime is 254132055109987. The next prime is 254132055110111. The reversal of 254132055109997 is 799901550231452.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 166349659270921 + 87782395839076 = 12897661^2 + 9369226^2 .
It is a cyclic number.
It is not a de Polignac number, because 254132055109997 - 24 = 254132055109981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (254132055109987) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 127066027554998 + 127066027554999.
It is an arithmetic number, because the mean of its divisors is an integer number (127066027554999).
Almost surely, 2254132055109997 is an apocalyptic number.
It is an amenable number.
254132055109997 is a deficient number, since it is larger than the sum of its proper divisors (1).
254132055109997 is an equidigital number, since it uses as much as digits as its factorization.
254132055109997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30618000, while the sum is 62.
The spelling of 254132055109997 in words is "two hundred fifty-four trillion, one hundred thirty-two billion, fifty-five million, one hundred nine thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •