Base | Representation |
---|---|
bin | 101000000001… |
… | …010000110011 |
3 | 201201222212000 |
4 | 220001100303 |
5 | 10141202211 |
6 | 1012505043 |
7 | 155112543 |
oct | 50012063 |
9 | 21658760 |
10 | 10490931 |
11 | 5a15aa0 |
12 | 361b183 |
13 | 2234169 |
14 | 1571323 |
15 | dc3656 |
hex | a01433 |
10490931 has 16 divisors (see below), whose sum is σ = 16955520. Its totient is φ = 6357960.
The previous prime is 10490891. The next prime is 10490933. The reversal of 10490931 is 13909401.
It is not a de Polignac number, because 10490931 - 26 = 10490867 is a prime.
It is a super-2 number, since 2×104909312 = 220119266493522, which contains 22 as substring.
It is a Smith number, since the sum of its digits (27) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 10490895 and 10490904.
It is not an unprimeable number, because it can be changed into a prime (10490933) 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, 17365 + ... + 17958.
It is an arithmetic number, because the mean of its divisors is an integer number (1059720).
Almost surely, 210490931 is an apocalyptic number.
10490931 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10490931 is a deficient number, since it is larger than the sum of its proper divisors (6464589).
10490931 is a wasteful number, since it uses less digits than its factorization.
10490931 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35343 (or 35337 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 27.
The square root of 10490931 is about 3238.9706698271. The cubic root of 10490931 is about 218.9128946142.
The spelling of 10490931 in words is "ten million, four hundred ninety thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •