Base | Representation |
---|---|
bin | 110010100001101000… |
… | …000110111010111101 |
3 | 12012000212022012222212 |
4 | 302201220012322331 |
5 | 1342101310102222 |
6 | 40531144350205 |
7 | 3630253021433 |
oct | 624150067275 |
9 | 165025265885 |
10 | 54251253437 |
11 | 2100a466747 |
12 | a620775365 |
13 | 51677524c4 |
14 | 28a91a8d53 |
15 | 1627bea6e2 |
hex | ca1a06ebd |
54251253437 has 2 divisors, whose sum is σ = 54251253438. Its totient is φ = 54251253436.
The previous prime is 54251253391. The next prime is 54251253439. The reversal of 54251253437 is 73435215245.
54251253437 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 can be written as a sum of positive squares in only one way, i.e., 51614841721 + 2636411716 = 227189^2 + 51346^2 .
It is a cyclic number.
It is not a de Polignac number, because 54251253437 - 28 = 54251253181 is a prime.
Together with 54251253439, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 54251253394 and 54251253403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (54251253439) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27125626718 + 27125626719.
It is an arithmetic number, because the mean of its divisors is an integer number (27125626719).
Almost surely, 254251253437 is an apocalyptic number.
It is an amenable number.
54251253437 is a deficient number, since it is larger than the sum of its proper divisors (1).
54251253437 is an equidigital number, since it uses as much as digits as its factorization.
54251253437 is an evil number, because the sum of its binary digits is even.
The product of its digits is 504000, while the sum is 41.
The spelling of 54251253437 in words is "fifty-four billion, two hundred fifty-one million, two hundred fifty-three thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •