Base | Representation |
---|---|
bin | 110010111000010010… |
… | …100011111010100101 |
3 | 12020000100202210011002 |
4 | 302320102203322211 |
5 | 1343341124342442 |
6 | 41033010123045 |
7 | 3642550632542 |
oct | 627022437245 |
9 | 166010683132 |
10 | 54631480997 |
11 | 211950572a5 |
12 | a707b80485 |
13 | 51c8460122 |
14 | 29038a3bc9 |
15 | 164b2a5732 |
hex | cb84a3ea5 |
54631480997 has 2 divisors, whose sum is σ = 54631480998. Its totient is φ = 54631480996.
The previous prime is 54631480991. The next prime is 54631480999. The reversal of 54631480997 is 79908413645.
54631480997 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., 34607532961 + 20023948036 = 186031^2 + 141506^2 .
It is a cyclic number.
It is not a de Polignac number, because 54631480997 - 26 = 54631480933 is a prime.
It is a super-2 number, since 2×546314809972 (a number of 22 digits) contains 22 as substring.
Together with 54631480999, 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 (54631480991) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27315740498 + 27315740499.
It is an arithmetic number, because the mean of its divisors is an integer number (27315740499).
Almost surely, 254631480997 is an apocalyptic number.
It is an amenable number.
54631480997 is a deficient number, since it is larger than the sum of its proper divisors (1).
54631480997 is an equidigital number, since it uses as much as digits as its factorization.
54631480997 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6531840, while the sum is 56.
The spelling of 54631480997 in words is "fifty-four billion, six hundred thirty-one million, four hundred eighty thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •