Base | Representation |
---|---|
bin | 100001000111111… |
… | …110110111100001 |
3 | 1102201201112211201 |
4 | 201013332313201 |
5 | 2114232200031 |
6 | 131051241201 |
7 | 16525501051 |
oct | 4107766741 |
9 | 1381645751 |
10 | 555740641 |
11 | 265779195 |
12 | 136149201 |
13 | 8b1a0421 |
14 | 53b45561 |
15 | 33bc8d61 |
hex | 211fede1 |
555740641 has 2 divisors, whose sum is σ = 555740642. Its totient is φ = 555740640.
The previous prime is 555740621. The next prime is 555740657. The reversal of 555740641 is 146047555.
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., 534580641 + 21160000 = 23121^2 + 4600^2 .
It is a cyclic number.
It is not a de Polignac number, because 555740641 - 211 = 555738593 is a prime.
It is equal to p29130787 and since 555740641 and 29130787 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 555740641.
It is not a weakly prime, because it can be changed into another prime (555740621) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 277870320 + 277870321.
It is an arithmetic number, because the mean of its divisors is an integer number (277870321).
Almost surely, 2555740641 is an apocalyptic number.
It is an amenable number.
555740641 is a deficient number, since it is larger than the sum of its proper divisors (1).
555740641 is an equidigital number, since it uses as much as digits as its factorization.
555740641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84000, while the sum is 37.
The square root of 555740641 is about 23574.1519677803. The cubic root of 555740641 is about 822.1619732988.
The spelling of 555740641 in words is "five hundred fifty-five million, seven hundred forty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •