Base | Representation |
---|---|
bin | 10000000110110100011… |
… | …01011011010001100001 |
3 | 1221220110120021121110001 |
4 | 20003122031123101201 |
5 | 33031344143012221 |
6 | 1102123001540001 |
7 | 54661116620551 |
oct | 10033215332141 |
9 | 1856416247401 |
10 | 553416766561 |
11 | 1a378037886a |
12 | 8b30a1a4601 |
13 | 40257a34059 |
14 | 1cadd647161 |
15 | e5e0443391 |
hex | 80da35b461 |
553416766561 has 4 divisors (see below), whose sum is σ = 554217659824. Its totient is φ = 552615873300.
The previous prime is 553416766543. The next prime is 553416766577. The reversal of 553416766561 is 165667614355.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 165667614355 = 5 ⋅33133522871.
It is a cyclic number.
It is not a de Polignac number, because 553416766561 - 213 = 553416758369 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (553416766501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 400445595 + ... + 400446976.
It is an arithmetic number, because the mean of its divisors is an integer number (138554414956).
Almost surely, 2553416766561 is an apocalyptic number.
It is an amenable number.
553416766561 is a deficient number, since it is larger than the sum of its proper divisors (800893263).
553416766561 is an equidigital number, since it uses as much as digits as its factorization.
553416766561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 800893262.
The product of its digits is 13608000, while the sum is 55.
The spelling of 553416766561 in words is "five hundred fifty-three billion, four hundred sixteen million, seven hundred sixty-six thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •