Base | Representation |
---|---|
bin | 10000001011110110010… |
… | …00111101101001000101 |
3 | 1222011102201201212210021 |
4 | 20011323020331221011 |
5 | 33102411340302024 |
6 | 1103250531255141 |
7 | 55115043124435 |
oct | 10057310755105 |
9 | 1864381655707 |
10 | 556116728389 |
11 | 1a4936439082 |
12 | 8b94244a4b1 |
13 | 405982062c1 |
14 | 1ccb806a2c5 |
15 | e6ec4bbde4 |
hex | 817b23da45 |
556116728389 has 4 divisors (see below), whose sum is σ = 556118757900. Its totient is φ = 556114698880.
The previous prime is 556116728371. The next prime is 556116728417. The reversal of 556116728389 is 983827611655.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 162052943364 + 394063785025 = 402558^2 + 627745^2 .
It is a cyclic number.
It is not a de Polignac number, because 556116728389 - 27 = 556116728261 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (556116728309) 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 in 3 ways as a sum of consecutive naturals, for example, 524914 + ... + 1178035.
It is an arithmetic number, because the mean of its divisors is an integer number (139029689475).
Almost surely, 2556116728389 is an apocalyptic number.
It is an amenable number.
556116728389 is a deficient number, since it is larger than the sum of its proper divisors (2029511).
556116728389 is a wasteful number, since it uses less digits than its factorization.
556116728389 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2029510.
The product of its digits is 21772800, while the sum is 61.
The spelling of 556116728389 in words is "five hundred fifty-six billion, one hundred sixteen million, seven hundred twenty-eight thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •