Base | Representation |
---|---|
bin | 10000001011110110001… |
… | …00011101111101100001 |
3 | 1222011102122112000102001 |
4 | 20011323010131331201 |
5 | 33102411040100144 |
6 | 1103250450124001 |
7 | 55115030116153 |
oct | 10057304357541 |
9 | 1864378460361 |
10 | 556115550049 |
11 | 1a4935803844 |
12 | 8b941b80601 |
13 | 40597bb2b67 |
14 | 1ccb7c40ad3 |
15 | e6ec337bd4 |
hex | 817b11df61 |
556115550049 has 2 divisors, whose sum is σ = 556115550050. Its totient is φ = 556115550048.
The previous prime is 556115550047. The next prime is 556115550113. The reversal of 556115550049 is 940055511655.
556115550049 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 can be written as a sum of positive squares in only one way, i.e., 395609550625 + 160505999424 = 628975^2 + 400632^2 .
It is a cyclic number.
It is not a de Polignac number, because 556115550049 - 21 = 556115550047 is a prime.
Together with 556115550047, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 556115549990 and 556115550008.
It is not a weakly prime, because it can be changed into another prime (556115550043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 278057775024 + 278057775025.
It is an arithmetic number, because the mean of its divisors is an integer number (278057775025).
Almost surely, 2556115550049 is an apocalyptic number.
It is an amenable number.
556115550049 is a deficient number, since it is larger than the sum of its proper divisors (1).
556115550049 is an equidigital number, since it uses as much as digits as its factorization.
556115550049 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 675000, while the sum is 46.
The spelling of 556115550049 in words is "five hundred fifty-six billion, one hundred fifteen million, five hundred fifty thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •