Base | Representation |
---|---|
bin | 1101001010010010111011… |
… | …00010011011111101101001 |
3 | 10210110201221011021201011001 |
4 | 12211021131202123331221 |
5 | 12243132242042331334 |
6 | 141315201113235001 |
7 | 6044631264102226 |
oct | 645113542337551 |
9 | 123421834251131 |
10 | 28941058948969 |
11 | 924891a315142 |
12 | 32b4b7a102a61 |
13 | 131c18cc2316b |
14 | 720a7cd8494d |
15 | 352c53c87714 |
hex | 1a525d89bf69 |
28941058948969 has 2 divisors, whose sum is σ = 28941058948970. Its totient is φ = 28941058948968.
The previous prime is 28941058948933. The next prime is 28941058949027. The reversal of 28941058948969 is 96984985014982.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 28655005123369 + 286053825600 = 5353037^2 + 534840^2 .
It is a cyclic number.
It is not a de Polignac number, because 28941058948969 - 225 = 28941025394537 is a prime.
It is a super-2 number, since 2×289410589489692 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 28941058948892 and 28941058948901.
It is not a weakly prime, because it can be changed into another prime (28941058958969) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 14470529474484 + 14470529474485.
It is an arithmetic number, because the mean of its divisors is an integer number (14470529474485).
Almost surely, 228941058948969 is an apocalyptic number.
It is an amenable number.
28941058948969 is a deficient number, since it is larger than the sum of its proper divisors (1).
28941058948969 is an equidigital number, since it uses as much as digits as its factorization.
28941058948969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3224862720, while the sum is 82.
The spelling of 28941058948969 in words is "twenty-eight trillion, nine hundred forty-one billion, fifty-eight million, nine hundred forty-eight thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •