Base | Representation |
---|---|
bin | 110010111100100100… |
… | …011000100011000001 |
3 | 12020012100211122000122 |
4 | 302330210120203001 |
5 | 1344013013340024 |
6 | 41044052430025 |
7 | 3644412024353 |
oct | 627444304301 |
9 | 166170748018 |
10 | 54703261889 |
11 | 21221624351 |
12 | a728018315 |
13 | 520a2a3423 |
14 | 290d22b0d3 |
15 | 1652733d5e |
hex | cbc9188c1 |
54703261889 has 2 divisors, whose sum is σ = 54703261890. Its totient is φ = 54703261888.
The previous prime is 54703261853. The next prime is 54703261891. The reversal of 54703261889 is 98816230745.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 49591726864 + 5111535025 = 222692^2 + 71495^2 .
It is a cyclic number.
It is not a de Polignac number, because 54703261889 - 232 = 50408294593 is a prime.
It is a super-2 number, since 2×547032618892 (a number of 22 digits) contains 22 as substring.
Together with 54703261891, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 54703261889.
It is a weakly prime.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27351630944 + 27351630945.
It is an arithmetic number, because the mean of its divisors is an integer number (27351630945).
It is a 2-persistent number, because it is pandigital, and so is 2⋅54703261889 = 109406523778, but 3⋅54703261889 = 164109785667 is not.
Almost surely, 254703261889 is an apocalyptic number.
It is an amenable number.
54703261889 is a deficient number, since it is larger than the sum of its proper divisors (1).
54703261889 is an equidigital number, since it uses as much as digits as its factorization.
54703261889 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2903040, while the sum is 53.
The spelling of 54703261889 in words is "fifty-four billion, seven hundred three million, two hundred sixty-one thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •