Base | Representation |
---|---|
bin | 110101101011… |
… | …0110110110001 |
3 | 1221221210222021 |
4 | 1223112312301 |
5 | 24201034100 |
6 | 2443111441 |
7 | 461132431 |
oct | 153266661 |
9 | 57853867 |
10 | 28143025 |
11 | 149822a9 |
12 | 9512581 |
13 | 5aa49a1 |
14 | 3a482c1 |
15 | 270da1a |
hex | 1ad6db1 |
28143025 has 9 divisors (see below), whose sum is σ = 34930273. Its totient is φ = 22493200.
The previous prime is 28143013. The next prime is 28143061. The reversal of 28143025 is 52034182.
The square root of 28143025 is 5305.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 10609 + 28132416 = 103^2 + 5304^2 .
It is not a de Polignac number, because 28143025 - 213 = 28134833 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 25995 + ... + 27055.
Almost surely, 228143025 is an apocalyptic number.
28143025 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
28143025 is the 5305-th square number.
28143025 is the 2653-rd centered octagonal number.
It is an amenable number.
28143025 is a deficient number, since it is larger than the sum of its proper divisors (6787248).
28143025 is an frugal number, since it uses more digits than its factorization.
28143025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2132 (or 1066 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 25.
The cubic root of 28143025 is about 304.1750528327.
Multiplying 28143025 by its sum of digits (25), we get a square (703575625 = 265252).
28143025 divided by its sum of digits (25) gives a square (1125721 = 10612).
The spelling of 28143025 in words is "twenty-eight million, one hundred forty-three thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •