Base | Representation |
---|---|
bin | 110110010100… |
… | …0010001010101 |
3 | 1222120202102020 |
4 | 1230220101111 |
5 | 24242222001 |
6 | 2454203353 |
7 | 464021604 |
oct | 154502125 |
9 | 58522366 |
10 | 28476501 |
11 | 1508a8a9 |
12 | 9653559 |
13 | 5b90701 |
14 | 3ad3a3b |
15 | 2777736 |
hex | 1b28455 |
28476501 has 8 divisors (see below), whose sum is σ = 38776704. Its totient is φ = 18580320.
The previous prime is 28476493. The next prime is 28476523. The reversal of 28476501 is 10567482.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 28476501 - 23 = 28476493 is a prime.
It is a super-2 number, since 2×284765012 = 1621822218406002, which contains 22 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28486501) 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 in 7 ways as a sum of consecutive naturals, for example, 100840 + ... + 101121.
It is an arithmetic number, because the mean of its divisors is an integer number (4847088).
Almost surely, 228476501 is an apocalyptic number.
It is an amenable number.
28476501 is a deficient number, since it is larger than the sum of its proper divisors (10300203).
28476501 is a wasteful number, since it uses less digits than its factorization.
28476501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202011.
The product of its (nonzero) digits is 13440, while the sum is 33.
The square root of 28476501 is about 5336.3377891584. The cubic root of 28476501 is about 305.3717620325.
The spelling of 28476501 in words is "twenty-eight million, four hundred seventy-six thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •