Base | Representation |
---|---|
bin | 10000001011110101011… |
… | …11011000001011010011 |
3 | 1222011102021010010102201 |
4 | 20011322233120023103 |
5 | 33102403131140311 |
6 | 1103250131424031 |
7 | 55114632121354 |
oct | 10057257301323 |
9 | 1864367103381 |
10 | 556110021331 |
11 | 1a4932677a57 |
12 | 8b940155017 |
13 | 405969c8527 |
14 | 1ccb7201d2b |
15 | e6ebae49c1 |
hex | 817abd82d3 |
556110021331 has 2 divisors, whose sum is σ = 556110021332. Its totient is φ = 556110021330.
The previous prime is 556110021323. The next prime is 556110021343. The reversal of 556110021331 is 133120011655.
556110021331 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 556110021331 - 23 = 556110021323 is a prime.
It is a super-2 number, since 2×5561100213312 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 556110021331.
It is not a weakly prime, because it can be changed into another prime (556110021301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 278055010665 + 278055010666.
It is an arithmetic number, because the mean of its divisors is an integer number (278055010666).
Almost surely, 2556110021331 is an apocalyptic number.
556110021331 is a deficient number, since it is larger than the sum of its proper divisors (1).
556110021331 is an equidigital number, since it uses as much as digits as its factorization.
556110021331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2700, while the sum is 28.
Adding to 556110021331 its reverse (133120011655), we get a palindrome (689230032986).
The spelling of 556110021331 in words is "five hundred fifty-six billion, one hundred ten million, twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •