Base | Representation |
---|---|
bin | 101000000001… |
… | …011011110001 |
3 | 201202000211000 |
4 | 220001123301 |
5 | 10141213013 |
6 | 1012512213 |
7 | 155114565 |
oct | 50013361 |
9 | 21660730 |
10 | 10491633 |
11 | 5a16579 |
12 | 361b669 |
13 | 2234589 |
14 | 15716a5 |
15 | dc3973 |
hex | a016f1 |
10491633 has 16 divisors (see below), whose sum is σ = 15759040. Its totient is φ = 6897312.
The previous prime is 10491623. The next prime is 10491643. The reversal of 10491633 is 33619401.
It is an interprime number because it is at equal distance from previous prime (10491623) and next prime (10491643).
It is not a de Polignac number, because 10491633 - 210 = 10490609 is a prime.
It is a super-2 number, since 2×104916332 = 220148726013378, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a plaindrome in base 13.
It is a junction number, because it is equal to n+sod(n) for n = 10491597 and 10491606.
It is not an unprimeable number, because it can be changed into a prime (10491623) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 691 + ... + 4632.
It is an arithmetic number, because the mean of its divisors is an integer number (984940).
Almost surely, 210491633 is an apocalyptic number.
It is an amenable number.
10491633 is a deficient number, since it is larger than the sum of its proper divisors (5267407).
10491633 is an equidigital number, since it uses as much as digits as its factorization.
10491633 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5405 (or 5399 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 27.
The square root of 10491633 is about 3239.0790357754. The cubic root of 10491633 is about 218.9177773529.
The spelling of 10491633 in words is "ten million, four hundred ninety-one thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •