Base | Representation |
---|---|
bin | 100001000111001… |
… | …011011100100111 |
3 | 1102201022211221001 |
4 | 201013023130213 |
5 | 2114203430043 |
6 | 131042534131 |
7 | 16523633026 |
oct | 4107133447 |
9 | 1381284831 |
10 | 555530023 |
11 | 265644a24 |
12 | 136067347 |
13 | 8b1285b9 |
14 | 53acc8bd |
15 | 33b8674d |
hex | 211cb727 |
555530023 has 2 divisors, whose sum is σ = 555530024. Its totient is φ = 555530022.
The previous prime is 555530021. The next prime is 555530069. The reversal of 555530023 is 320035555.
555530023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 555530023 - 21 = 555530021 is a prime.
It is a super-2 number, since 2×5555300232 = 617227212908761058, which contains 22 as substring.
Together with 555530021, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 555529973 and 555530000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (555530021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 277765011 + 277765012.
It is an arithmetic number, because the mean of its divisors is an integer number (277765012).
Almost surely, 2555530023 is an apocalyptic number.
555530023 is a deficient number, since it is larger than the sum of its proper divisors (1).
555530023 is an equidigital number, since it uses as much as digits as its factorization.
555530023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11250, while the sum is 28.
The square root of 555530023 is about 23569.6844060331. The cubic root of 555530023 is about 822.0580975112.
Adding to 555530023 its reverse (320035555), we get a palindrome (875565578).
The spelling of 555530023 in words is "five hundred fifty-five million, five hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •