Base | Representation |
---|---|
bin | 100000110111101… |
… | …001110110101101 |
3 | 1102102200002021102 |
4 | 200313221312231 |
5 | 2112133212034 |
6 | 130415412445 |
7 | 16444222613 |
oct | 4067516655 |
9 | 1372602242 |
10 | 551460269 |
11 | 263315298 |
12 | 134824125 |
13 | 8a332069 |
14 | 5334d6b3 |
15 | 3363097e |
hex | 20de9dad |
551460269 has 2 divisors, whose sum is σ = 551460270. Its totient is φ = 551460268.
The previous prime is 551460253. The next prime is 551460277. The reversal of 551460269 is 962064155.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 550840900 + 619369 = 23470^2 + 787^2 .
It is a cyclic number.
It is not a de Polignac number, because 551460269 - 24 = 551460253 is a prime.
It is a super-2 number, since 2×5514602692 = 608216856571104722, which contains 22 as substring.
It is equal to p28918091 and since 551460269 and 28918091 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (551460869) 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, 275730134 + 275730135.
It is an arithmetic number, because the mean of its divisors is an integer number (275730135).
Almost surely, 2551460269 is an apocalyptic number.
It is an amenable number.
551460269 is a deficient number, since it is larger than the sum of its proper divisors (1).
551460269 is an equidigital number, since it uses as much as digits as its factorization.
551460269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64800, while the sum is 38.
The square root of 551460269 is about 23483.1912013678. The cubic root of 551460269 is about 820.0457385750.
The spelling of 551460269 in words is "five hundred fifty-one million, four hundred sixty thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •