Base | Representation |
---|---|
bin | 11000001101000000001110… |
… | …01000111110011101111011 |
3 | 20222110002210002101001022122 |
4 | 30012200013020332131323 |
5 | 23434002412224304223 |
6 | 305110245503311455 |
7 | 14132155225005065 |
oct | 1406400710763573 |
9 | 228402702331278 |
10 | 53223354525563 |
11 | 15a5a997110762 |
12 | 5b770618ab58b |
13 | 2390c2cc10231 |
14 | d2004a1d8735 |
15 | 6246dcd175c8 |
hex | 30680723e77b |
53223354525563 has 2 divisors, whose sum is σ = 53223354525564. Its totient is φ = 53223354525562.
The previous prime is 53223354525511. The next prime is 53223354525571. The reversal of 53223354525563 is 36552545332235.
53223354525563 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 53223354525563 - 238 = 52948476618619 is a prime.
It is not a weakly prime, because it can be changed into another prime (53223354521563) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26611677262781 + 26611677262782.
It is an arithmetic number, because the mean of its divisors is an integer number (26611677262782).
Almost surely, 253223354525563 is an apocalyptic number.
53223354525563 is a deficient number, since it is larger than the sum of its proper divisors (1).
53223354525563 is an equidigital number, since it uses as much as digits as its factorization.
53223354525563 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 48600000, while the sum is 53.
Adding to 53223354525563 its reverse (36552545332235), we get a palindrome (89775899857798).
The spelling of 53223354525563 in words is "fifty-three trillion, two hundred twenty-three billion, three hundred fifty-four million, five hundred twenty-five thousand, five hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.527 sec. • engine limits •