Base | Representation |
---|---|
bin | 110101101010… |
… | …0000000101101 |
3 | 1221221012222201 |
4 | 1223110000231 |
5 | 24200200443 |
6 | 2442541501 |
7 | 461053444 |
oct | 153240055 |
9 | 57835881 |
10 | 28131373 |
11 | 14974576 |
12 | 9507891 |
13 | 5a9c5aa |
14 | 3a43d5b |
15 | 270a34d |
hex | 1ad402d |
28131373 has 2 divisors, whose sum is σ = 28131374. Its totient is φ = 28131372.
The previous prime is 28131329. The next prime is 28131401. The reversal of 28131373 is 37313182.
It is an a-pointer prime, because the next prime (28131401) can be obtained adding 28131373 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21511044 + 6620329 = 4638^2 + 2573^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-28131373 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (28131473) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 14065686 + 14065687.
It is an arithmetic number, because the mean of its divisors is an integer number (14065687).
Almost surely, 228131373 is an apocalyptic number.
It is an amenable number.
28131373 is a deficient number, since it is larger than the sum of its proper divisors (1).
28131373 is an equidigital number, since it uses as much as digits as its factorization.
28131373 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3024, while the sum is 28.
The square root of 28131373 is about 5303.9016770676. The cubic root of 28131373 is about 304.1330680429.
It can be divided in two parts, 2813 and 1373, that added together give a triangular number (4186 = T91).
The spelling of 28131373 in words is "twenty-eight million, one hundred thirty-one thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •