Base | Representation |
---|---|
bin | 100000110110110… |
… | …100001101100111 |
3 | 1102102020220212201 |
4 | 200312310031213 |
5 | 2112104144201 |
6 | 130410555331 |
7 | 16442316211 |
oct | 4066641547 |
9 | 1372226781 |
10 | 551240551 |
11 | 263185204 |
12 | 134738b47 |
13 | 8a286054 |
14 | 532d35b1 |
15 | 335da801 |
hex | 20db4367 |
551240551 has 4 divisors (see below), whose sum is σ = 552776400. Its totient is φ = 549704704.
The previous prime is 551240539. The next prime is 551240561. The reversal of 551240551 is 155042155.
551240551 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 155042155 = 5 ⋅31008431.
It is a cyclic number.
It is not a de Polignac number, because 551240551 - 211 = 551238503 is a prime.
It is a super-2 number, since 2×5512405512 = 607732290133567202, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (551240561) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 767386 + ... + 768103.
It is an arithmetic number, because the mean of its divisors is an integer number (138194100).
Almost surely, 2551240551 is an apocalyptic number.
551240551 is a deficient number, since it is larger than the sum of its proper divisors (1535849).
551240551 is a wasteful number, since it uses less digits than its factorization.
551240551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1535848.
The product of its (nonzero) digits is 5000, while the sum is 28.
The square root of 551240551 is about 23478.5125380634. The cubic root of 551240551 is about 819.9368139891.
The spelling of 551240551 in words is "five hundred fifty-one million, two hundred forty thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •