Base | Representation |
---|---|
bin | 11000110110011101000000… |
… | …01010110110100011011011 |
3 | 21011111020220010220112111111 |
4 | 30123032200022312203123 |
5 | 24130321143330401314 |
6 | 312120423554041151 |
7 | 14340104245466041 |
oct | 1433164012664333 |
9 | 234436803815444 |
10 | 54647556106459 |
11 | 16459997843978 |
12 | 616708bb791b7 |
13 | 246531c802174 |
14 | d6cd54b14391 |
15 | 64b7959d5ec4 |
hex | 31b3a02b68db |
54647556106459 has 2 divisors, whose sum is σ = 54647556106460. Its totient is φ = 54647556106458.
The previous prime is 54647556106421. The next prime is 54647556106477. The reversal of 54647556106459 is 95460165574645.
54647556106459 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 is a cyclic number.
It is not a de Polignac number, because 54647556106459 - 237 = 54510117152987 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 54647556106394 and 54647556106403.
It is not a weakly prime, because it can be changed into another prime (54647556106159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27323778053229 + 27323778053230.
It is an arithmetic number, because the mean of its divisors is an integer number (27323778053230).
Almost surely, 254647556106459 is an apocalyptic number.
54647556106459 is a deficient number, since it is larger than the sum of its proper divisors (1).
54647556106459 is an equidigital number, since it uses as much as digits as its factorization.
54647556106459 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 544320000, while the sum is 67.
The spelling of 54647556106459 in words is "fifty-four trillion, six hundred forty-seven billion, five hundred fifty-six million, one hundred six thousand, four hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •