Base | Representation |
---|---|
bin | 100000110110011… |
… | …000010000000111 |
3 | 1102102001002202221 |
4 | 200312120100013 |
5 | 2112042013043 |
6 | 130404313211 |
7 | 16441331260 |
oct | 4066302007 |
9 | 1372032687 |
10 | 551126023 |
11 | 263107158 |
12 | 1346a2807 |
13 | 8a245b96 |
14 | 532a3967 |
15 | 335b68ed |
hex | 20d98407 |
551126023 has 8 divisors (see below), whose sum is σ = 657243648. Its totient is φ = 451854744.
The previous prime is 551125999. The next prime is 551126047. The reversal of 551126023 is 320621155.
It is an interprime number because it is at equal distance from previous prime (551125999) and next prime (551126047).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 551126023 - 29 = 551125511 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (551126053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1711411 + ... + 1711732.
It is an arithmetic number, because the mean of its divisors is an integer number (82155456).
Almost surely, 2551126023 is an apocalyptic number.
551126023 is a deficient number, since it is larger than the sum of its proper divisors (106117625).
551126023 is a wasteful number, since it uses less digits than its factorization.
551126023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3423173.
The product of its (nonzero) digits is 1800, while the sum is 25.
The square root of 551126023 is about 23476.0734152882. The cubic root of 551126023 is about 819.8800255765.
Adding to 551126023 its reverse (320621155), we get a palindrome (871747178).
The spelling of 551126023 in words is "five hundred fifty-one million, one hundred twenty-six thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •