Base | Representation |
---|---|
bin | 1101000001000110001110… |
… | …11100110100101010010101 |
3 | 10202100112011001012022221121 |
4 | 12200203013130310222111 |
5 | 12222443004110013021 |
6 | 140514051450443541 |
7 | 6013042250544106 |
oct | 640430734645225 |
9 | 122315131168847 |
10 | 28625008282261 |
11 | 9136885a17436 |
12 | 32638754335b1 |
13 | 12c84329ab641 |
14 | 70d65a2823ad |
15 | 349907425741 |
hex | 1a08c7734a95 |
28625008282261 has 2 divisors, whose sum is σ = 28625008282262. Its totient is φ = 28625008282260.
The previous prime is 28625008282259. The next prime is 28625008282267. The reversal of 28625008282261 is 16228280052682.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14470370352036 + 14154637930225 = 3803994^2 + 3762265^2 .
It is a cyclic number.
It is not a de Polignac number, because 28625008282261 - 21 = 28625008282259 is a prime.
Together with 28625008282259, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 28625008282199 and 28625008282208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (28625008282267) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 14312504141130 + 14312504141131.
It is an arithmetic number, because the mean of its divisors is an integer number (14312504141131).
Almost surely, 228625008282261 is an apocalyptic number.
It is an amenable number.
28625008282261 is a deficient number, since it is larger than the sum of its proper divisors (1).
28625008282261 is an equidigital number, since it uses as much as digits as its factorization.
28625008282261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2949120, while the sum is 52.
The spelling of 28625008282261 in words is "twenty-eight trillion, six hundred twenty-five billion, eight million, two hundred eighty-two thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •