Base | Representation |
---|---|
bin | 101000000000… |
… | …110111000001 |
3 | 201201220120220 |
4 | 220000313001 |
5 | 10141124111 |
6 | 1012453253 |
7 | 155104665 |
oct | 50006701 |
9 | 21656526 |
10 | 10489281 |
11 | 5a14830 |
12 | 361a229 |
13 | 223349a |
14 | 15708a5 |
15 | dc2e06 |
hex | a00dc1 |
10489281 has 8 divisors (see below), whose sum is σ = 15257184. Its totient is φ = 6357120.
The previous prime is 10489277. The next prime is 10489307. The reversal of 10489281 is 18298401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10489281 - 22 = 10489277 is a prime.
It is a super-2 number, since 2×104892812 = 220050031793922, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 317857 = 10489281 / (1 + 0 + 4 + 8 + 9 + 2 + 8 + 1).
It is a plaindrome in base 13.
It is not an unprimeable number, because it can be changed into a prime (10489201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 158896 + ... + 158961.
It is an arithmetic number, because the mean of its divisors is an integer number (1907148).
Almost surely, 210489281 is an apocalyptic number.
10489281 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10489281 is a deficient number, since it is larger than the sum of its proper divisors (4767903).
10489281 is a wasteful number, since it uses less digits than its factorization.
10489281 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 317871.
The product of its (nonzero) digits is 4608, while the sum is 33.
The square root of 10489281 is about 3238.7159492614. The cubic root of 10489281 is about 218.9014172339.
The spelling of 10489281 in words is "ten million, four hundred eighty-nine thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •