Base | Representation |
---|---|
bin | 111010000110110011010100… |
… | …110000110011010010100101 |
3 | 1020111211201212021100201100201 |
4 | 322012303110300303102211 |
5 | 231443444321130043124 |
6 | 2303303535500510501 |
7 | 104554114263234622 |
oct | 7206632460632245 |
9 | 1214751767321321 |
10 | 255554123674789 |
11 | 74477993594335 |
12 | 247b4126b4b431 |
13 | ac7985c097a44 |
14 | 4716c58073349 |
15 | 1e8283894d144 |
hex | e86cd4c334a5 |
255554123674789 has 2 divisors, whose sum is σ = 255554123674790. Its totient is φ = 255554123674788.
The previous prime is 255554123674697. The next prime is 255554123674793. The reversal of 255554123674789 is 987476321455552.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 223672663376100 + 31881460298689 = 14955690^2 + 5646367^2 .
It is a cyclic number.
It is not a de Polignac number, because 255554123674789 - 241 = 253355100419237 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (255554123672789) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 127777061837394 + 127777061837395.
It is an arithmetic number, because the mean of its divisors is an integer number (127777061837395).
Almost surely, 2255554123674789 is an apocalyptic number.
It is an amenable number.
255554123674789 is a deficient number, since it is larger than the sum of its proper divisors (1).
255554123674789 is an equidigital number, since it uses as much as digits as its factorization.
255554123674789 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2540160000, while the sum is 73.
The spelling of 255554123674789 in words is "two hundred fifty-five trillion, five hundred fifty-four billion, one hundred twenty-three million, six hundred seventy-four thousand, seven hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •