Base | Representation |
---|---|
bin | 110010100001110100… |
… | …010110001011011101 |
3 | 12012001002100012211222 |
4 | 302201310112023131 |
5 | 1342103120233121 |
6 | 40531341223125 |
7 | 3630322213031 |
oct | 624164261335 |
9 | 165032305758 |
10 | 54254461661 |
11 | 21011258074 |
12 | a621861aa5 |
13 | 516830686a |
14 | 28a97a21c1 |
15 | 16281310ab |
hex | ca1d162dd |
54254461661 has 2 divisors, whose sum is σ = 54254461662. Its totient is φ = 54254461660.
The previous prime is 54254461633. The next prime is 54254461663. The reversal of 54254461661 is 16616445245.
54254461661 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., 49963425625 + 4291036036 = 223525^2 + 65506^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-54254461661 is a prime.
It is a super-2 number, since 2×542544616612 (a number of 22 digits) contains 22 as substring.
Together with 54254461663, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (54254461663) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27127230830 + 27127230831.
It is an arithmetic number, because the mean of its divisors is an integer number (27127230831).
Almost surely, 254254461661 is an apocalyptic number.
It is an amenable number.
54254461661 is a deficient number, since it is larger than the sum of its proper divisors (1).
54254461661 is an equidigital number, since it uses as much as digits as its factorization.
54254461661 is an evil number, because the sum of its binary digits is even.
The product of its digits is 691200, while the sum is 44.
The spelling of 54254461661 in words is "fifty-four billion, two hundred fifty-four million, four hundred sixty-one thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •