Base | Representation |
---|---|
bin | 11010011000011101… |
… | …000001110100101101 |
3 | 2201010012021122121220 |
4 | 122120131001310231 |
5 | 431003323102003 |
6 | 21002525413553 |
7 | 2021661130032 |
oct | 323035016455 |
9 | 81105248556 |
10 | 28327550253 |
11 | 11017188862 |
12 | 55a6a0a2b9 |
13 | 2895a43772 |
14 | 152a295389 |
15 | b0bdb8353 |
hex | 698741d2d |
28327550253 has 4 divisors (see below), whose sum is σ = 37770067008. Its totient is φ = 18885033500.
The previous prime is 28327550249. The next prime is 28327550257. The reversal of 28327550253 is 35205572382.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (28327550249) and next prime (28327550257).
It is a cyclic number.
It is not a de Polignac number, because 28327550253 - 22 = 28327550249 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28327550257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4721258373 + ... + 4721258378.
It is an arithmetic number, because the mean of its divisors is an integer number (9442516752).
Almost surely, 228327550253 is an apocalyptic number.
It is an amenable number.
28327550253 is a deficient number, since it is larger than the sum of its proper divisors (9442516755).
28327550253 is an equidigital number, since it uses as much as digits as its factorization.
28327550253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9442516754.
The product of its (nonzero) digits is 504000, while the sum is 42.
The spelling of 28327550253 in words is "twenty-eight billion, three hundred twenty-seven million, five hundred fifty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •