Base | Representation |
---|---|
bin | 1100110000011100110101… |
… | …00110101110011010110001 |
3 | 10200022211202120012212010211 |
4 | 12120032122212232122301 |
5 | 12134110043431044131 |
6 | 135355214253224121 |
7 | 5623523055164455 |
oct | 630163246563261 |
9 | 120284676185124 |
10 | 28053025253041 |
11 | 8a36248461748 |
12 | 3190a45492041 |
13 | 1286509631569 |
14 | 6cdab8d28665 |
15 | 339acc0725b1 |
hex | 19839a9ae6b1 |
28053025253041 has 2 divisors, whose sum is σ = 28053025253042. Its totient is φ = 28053025253040.
The previous prime is 28053025252997. The next prime is 28053025253053. The reversal of 28053025253041 is 14035252035082.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15837972293025 + 12215052960016 = 3979695^2 + 3495004^2 .
It is a cyclic number.
It is not a de Polignac number, because 28053025253041 - 215 = 28053025220273 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 28053025252985 and 28053025253003.
It is not a weakly prime, because it can be changed into another prime (28053025233041) 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, 14026512626520 + 14026512626521.
It is an arithmetic number, because the mean of its divisors is an integer number (14026512626521).
Almost surely, 228053025253041 is an apocalyptic number.
It is an amenable number.
28053025253041 is a deficient number, since it is larger than the sum of its proper divisors (1).
28053025253041 is an equidigital number, since it uses as much as digits as its factorization.
28053025253041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288000, while the sum is 40.
The spelling of 28053025253041 in words is "twenty-eight trillion, fifty-three billion, twenty-five million, two hundred fifty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •