Base | Representation |
---|---|
bin | 110001101100001110… |
… | …011010001001101101 |
3 | 12002201102110021212121 |
4 | 301230032122021231 |
5 | 1333232430332023 |
6 | 40302221432541 |
7 | 3566123525335 |
oct | 615416321155 |
9 | 162642407777 |
10 | 53355324013 |
11 | 2069a764702 |
12 | a41070b751 |
13 | 5053c52854 |
14 | 28221cc0c5 |
15 | 15c4224d5d |
hex | c6c39a26d |
53355324013 has 2 divisors, whose sum is σ = 53355324014. Its totient is φ = 53355324012.
The previous prime is 53355323999. The next prime is 53355324037. The reversal of 53355324013 is 31042355335.
53355324013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 53075865924 + 279458089 = 230382^2 + 16717^2 .
It is a cyclic number.
It is not a de Polignac number, because 53355324013 - 25 = 53355323981 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 53355324013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53355324083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26677662006 + 26677662007.
It is an arithmetic number, because the mean of its divisors is an integer number (26677662007).
Almost surely, 253355324013 is an apocalyptic number.
It is an amenable number.
53355324013 is a deficient number, since it is larger than the sum of its proper divisors (1).
53355324013 is an equidigital number, since it uses as much as digits as its factorization.
53355324013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 81000, while the sum is 34.
Adding to 53355324013 its reverse (31042355335), we get a palindrome (84397679348).
The spelling of 53355324013 in words is "fifty-three billion, three hundred fifty-five million, three hundred twenty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.237 sec. • engine limits •