Base | Representation |
---|---|
bin | 10000001011101000101… |
… | …11010111101000010101 |
3 | 1222011010210212011000201 |
4 | 20011310113113220111 |
5 | 33102143241024331 |
6 | 1103231351140501 |
7 | 55112163032404 |
oct | 10056427275025 |
9 | 1864123764021 |
10 | 556003064341 |
11 | 1a488826464a |
12 | 8b910374731 |
13 | 4057a7ba27a |
14 | 1cca6d1d63b |
15 | e6e2518a61 |
hex | 81745d7a15 |
556003064341 has 2 divisors, whose sum is σ = 556003064342. Its totient is φ = 556003064340.
The previous prime is 556003064329. The next prime is 556003064411. The reversal of 556003064341 is 143460300655.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 408773537316 + 147229527025 = 639354^2 + 383705^2 .
It is a cyclic number.
It is not a de Polignac number, because 556003064341 - 27 = 556003064213 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 556003064341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (556003065341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 278001532170 + 278001532171.
It is an arithmetic number, because the mean of its divisors is an integer number (278001532171).
Almost surely, 2556003064341 is an apocalyptic number.
It is an amenable number.
556003064341 is a deficient number, since it is larger than the sum of its proper divisors (1).
556003064341 is an equidigital number, since it uses as much as digits as its factorization.
556003064341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 129600, while the sum is 37.
Adding to 556003064341 its reverse (143460300655), we get a palindrome (699463364996).
The spelling of 556003064341 in words is "five hundred fifty-six billion, three million, sixty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •