Base | Representation |
---|---|
bin | 100001001000111… |
… | …110001101000101 |
3 | 1102202012201201011 |
4 | 201020332031011 |
5 | 2114314000234 |
6 | 131101002221 |
7 | 16530631312 |
oct | 4110761505 |
9 | 1382181634 |
10 | 556000069 |
11 | 265936099 |
12 | 136253371 |
13 | 8b261531 |
14 | 53bb1d09 |
15 | 33c2ab64 |
hex | 2123e345 |
556000069 has 2 divisors, whose sum is σ = 556000070. Its totient is φ = 556000068.
The previous prime is 556000033. The next prime is 556000121. The reversal of 556000069 is 960000655.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 530749444 + 25250625 = 23038^2 + 5025^2 .
It is a cyclic number.
It is not a de Polignac number, because 556000069 - 29 = 555999557 is a prime.
It is a super-2 number, since 2×5560000692 = 618272153456009522, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 556000069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (556070069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 278000034 + 278000035.
It is an arithmetic number, because the mean of its divisors is an integer number (278000035).
Almost surely, 2556000069 is an apocalyptic number.
It is an amenable number.
556000069 is a deficient number, since it is larger than the sum of its proper divisors (1).
556000069 is an equidigital number, since it uses as much as digits as its factorization.
556000069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8100, while the sum is 31.
The square root of 556000069 is about 23579.6537082291. The cubic root of 556000069 is about 822.2898858777.
The spelling of 556000069 in words is "five hundred fifty-six million, sixty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •