Base | Representation |
---|---|
bin | 10000001000110001010… |
… | …10110111100011110101 |
3 | 1222000011121002201110012 |
4 | 20010120222313203311 |
5 | 33041020424000424 |
6 | 1102414554110005 |
7 | 55026102643454 |
oct | 10043052674365 |
9 | 1860147081405 |
10 | 554464671989 |
11 | 1a4168941708 |
12 | 8b56111b305 |
13 | 40393b75137 |
14 | 1cb9c8a4b9b |
15 | e652438b0e |
hex | 8118ab78f5 |
554464671989 has 2 divisors, whose sum is σ = 554464671990. Its totient is φ = 554464671988.
The previous prime is 554464671911. The next prime is 554464672033. The reversal of 554464671989 is 989176464455.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 301296699025 + 253167972964 = 548905^2 + 503158^2 .
It is a cyclic number.
It is not a de Polignac number, because 554464671989 - 224 = 554447894773 is a prime.
It is a super-2 number, since 2×5544646719892 (a number of 24 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (554464671289) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 277232335994 + 277232335995.
It is an arithmetic number, because the mean of its divisors is an integer number (277232335995).
Almost surely, 2554464671989 is an apocalyptic number.
It is an amenable number.
554464671989 is a deficient number, since it is larger than the sum of its proper divisors (1).
554464671989 is an equidigital number, since it uses as much as digits as its factorization.
554464671989 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 261273600, while the sum is 68.
The spelling of 554464671989 in words is "five hundred fifty-four billion, four hundred sixty-four million, six hundred seventy-one thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •