Base | Representation |
---|---|
bin | 100000110010100… |
… | …111101101111101 |
3 | 1102100012001022002 |
4 | 200302213231331 |
5 | 2111314001142 |
6 | 130331232045 |
7 | 16430056013 |
oct | 4062475575 |
9 | 1370161262 |
10 | 550140797 |
11 | 2625a3a18 |
12 | 1342a8625 |
13 | 89c8c5cb |
14 | 530c88b3 |
15 | 3346ea32 |
hex | 20ca7b7d |
550140797 has 2 divisors, whose sum is σ = 550140798. Its totient is φ = 550140796.
The previous prime is 550140779. The next prime is 550140809. The reversal of 550140797 is 797041055.
Together with previous prime (550140779) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 286760356 + 263380441 = 16934^2 + 16229^2 .
It is a cyclic number.
It is not a de Polignac number, because 550140797 - 28 = 550140541 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 550140797.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (550140737) 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, 275070398 + 275070399.
It is an arithmetic number, because the mean of its divisors is an integer number (275070399).
Almost surely, 2550140797 is an apocalyptic number.
It is an amenable number.
550140797 is a deficient number, since it is larger than the sum of its proper divisors (1).
550140797 is an equidigital number, since it uses as much as digits as its factorization.
550140797 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 44100, while the sum is 38.
The square root of 550140797 is about 23455.0804091566. The cubic root of 550140797 is about 819.3911785610.
The spelling of 550140797 in words is "five hundred fifty million, one hundred forty thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •