Base | Representation |
---|---|
bin | 111110111010000110111110… |
… | …1110111010100101111101101 |
3 | 2200120020012011022202022122011 |
4 | 1331310031331313110233231 |
5 | 1040011442432122010203 |
6 | 5240510454333121221 |
7 | 224360541456152065 |
oct | 17564157567245755 |
9 | 2616205138668564 |
10 | 553344223235053 |
11 | 150348a703a8978 |
12 | 52089998929211 |
13 | 1a99b1a074a463 |
14 | 9a900090d03a5 |
15 | 43e8b46ab676d |
hex | 1f7437ddd4bed |
553344223235053 has 2 divisors, whose sum is σ = 553344223235054. Its totient is φ = 553344223235052.
The previous prime is 553344223234973. The next prime is 553344223235059. The reversal of 553344223235053 is 350532322443355.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 407827240941289 + 145516982293764 = 20194733^2 + 12063042^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-553344223235053 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 553344223234988 and 553344223235006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (553344223235059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 276672111617526 + 276672111617527.
It is an arithmetic number, because the mean of its divisors is an integer number (276672111617527).
Almost surely, 2553344223235053 is an apocalyptic number.
It is an amenable number.
553344223235053 is a deficient number, since it is larger than the sum of its proper divisors (1).
553344223235053 is an equidigital number, since it uses as much as digits as its factorization.
553344223235053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19440000, while the sum is 49.
The spelling of 553344223235053 in words is "five hundred fifty-three trillion, three hundred forty-four billion, two hundred twenty-three million, two hundred thirty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •