Base | Representation |
---|---|
bin | 110001011110011101… |
… | …100000010100100111 |
3 | 12002010022221011021001 |
4 | 301132131200110213 |
5 | 1332244321303143 |
6 | 40223252134131 |
7 | 3560320644613 |
oct | 613635402447 |
9 | 162108834231 |
10 | 53124400423 |
11 | 20591380366 |
12 | a367307347 |
13 | 501815c083 |
14 | 27dd67a343 |
15 | 15add0d14d |
hex | c5e760527 |
53124400423 has 2 divisors, whose sum is σ = 53124400424. Its totient is φ = 53124400422.
The previous prime is 53124400391. The next prime is 53124400451. The reversal of 53124400423 is 32400442135.
It is a happy number.
53124400423 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (53124400451) can be obtained adding 53124400423 to its sum of digits (28).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 53124400423 - 25 = 53124400391 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 53124400391 and 53124400400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53124400523) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26562200211 + 26562200212.
It is an arithmetic number, because the mean of its divisors is an integer number (26562200212).
Almost surely, 253124400423 is an apocalyptic number.
53124400423 is a deficient number, since it is larger than the sum of its proper divisors (1).
53124400423 is an equidigital number, since it uses as much as digits as its factorization.
53124400423 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11520, while the sum is 28.
Adding to 53124400423 its reverse (32400442135), we get a palindrome (85524842558).
The spelling of 53124400423 in words is "fifty-three billion, one hundred twenty-four million, four hundred thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •