Base | Representation |
---|---|
bin | 110010011111100110… |
… | …100110001001010101 |
3 | 12011221111102100012221 |
4 | 302133212212021111 |
5 | 1342014112140423 |
6 | 40523532542341 |
7 | 3626361316435 |
oct | 623746461125 |
9 | 164844370187 |
10 | 54217302613 |
11 | 20aa2287a11 |
12 | a6113219b1 |
13 | 51606c6166 |
14 | 28a488c2c5 |
15 | 1624c40e5d |
hex | c9f9a6255 |
54217302613 has 2 divisors, whose sum is σ = 54217302614. Its totient is φ = 54217302612.
The previous prime is 54217302599. The next prime is 54217302631. The reversal of 54217302613 is 31620371245.
Together with next prime (54217302631) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 53776218609 + 441084004 = 231897^2 + 21002^2 .
It is a cyclic number.
It is not a de Polignac number, because 54217302613 - 233 = 45627368021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (54217302653) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27108651306 + 27108651307.
It is an arithmetic number, because the mean of its divisors is an integer number (27108651307).
Almost surely, 254217302613 is an apocalyptic number.
It is an amenable number.
54217302613 is a deficient number, since it is larger than the sum of its proper divisors (1).
54217302613 is an equidigital number, since it uses as much as digits as its factorization.
54217302613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30240, while the sum is 34.
Adding to 54217302613 its reverse (31620371245), we get a palindrome (85837673858).
The spelling of 54217302613 in words is "fifty-four billion, two hundred seventeen million, three hundred two thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •