Base | Representation |
---|---|
bin | 11000110111010110011111… |
… | …11100101100001001011101 |
3 | 21011121012120021102022221212 |
4 | 30123223033330230021131 |
5 | 24131322402123040021 |
6 | 312142530455234205 |
7 | 14342246165324561 |
oct | 1433531774541135 |
9 | 234535507368855 |
10 | 54678422471261 |
11 | 16470a97026676 |
12 | 6171065078965 |
13 | 24681cb515154 |
14 | d706422416a1 |
15 | 64c4a06e585b |
hex | 31bacff2c25d |
54678422471261 has 2 divisors, whose sum is σ = 54678422471262. Its totient is φ = 54678422471260.
The previous prime is 54678422471237. The next prime is 54678422471269. The reversal of 54678422471261 is 16217422487645.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 50818278145636 + 3860144325625 = 7128694^2 + 1964725^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-54678422471261 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 54678422471261.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (54678422471269) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27339211235630 + 27339211235631.
It is an arithmetic number, because the mean of its divisors is an integer number (27339211235631).
Almost surely, 254678422471261 is an apocalyptic number.
It is an amenable number.
54678422471261 is a deficient number, since it is larger than the sum of its proper divisors (1).
54678422471261 is an equidigital number, since it uses as much as digits as its factorization.
54678422471261 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 36126720, while the sum is 59.
The spelling of 54678422471261 in words is "fifty-four trillion, six hundred seventy-eight billion, four hundred twenty-two million, four hundred seventy-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •