Base | Representation |
---|---|
bin | 100001000111000000110… |
… | …0101100000110011111101 |
3 | 121010000202021020001221201 |
4 | 1002032001211200303331 |
5 | 1044024003340223203 |
6 | 13402254040255501 |
7 | 646523506500313 |
oct | 102160145406375 |
9 | 17100667201851 |
10 | 4550544461053 |
11 | 14a4969796828 |
12 | 615b14171591 |
13 | 270164737516 |
14 | 11a3673000b3 |
15 | 7d58417ee1d |
hex | 42381960cfd |
4550544461053 has 2 divisors, whose sum is σ = 4550544461054. Its totient is φ = 4550544461052.
The previous prime is 4550544461041. The next prime is 4550544461063. The reversal of 4550544461053 is 3501644450554.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2329735164409 + 2220809296644 = 1526347^2 + 1490238^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4550544461053 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4550544460994 and 4550544461012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4550544461063) 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, 2275272230526 + 2275272230527.
It is an arithmetic number, because the mean of its divisors is an integer number (2275272230527).
Almost surely, 24550544461053 is an apocalyptic number.
It is an amenable number.
4550544461053 is a deficient number, since it is larger than the sum of its proper divisors (1).
4550544461053 is an equidigital number, since it uses as much as digits as its factorization.
4550544461053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880000, while the sum is 46.
The spelling of 4550544461053 in words is "four trillion, five hundred fifty billion, five hundred forty-four million, four hundred sixty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •