Base | Representation |
---|---|
bin | 101000000010… |
… | …001111111111 |
3 | 201202012101210 |
4 | 220002033333 |
5 | 10141314400 |
6 | 1012535503 |
7 | 155130411 |
oct | 50021777 |
9 | 21665353 |
10 | 10494975 |
11 | 5a19037 |
12 | 3621593 |
13 | 2235c5a |
14 | 15729b1 |
15 | dc4950 |
hex | a023ff |
10494975 has 24 divisors (see below), whose sum is σ = 17780112. Its totient is φ = 5459200.
The previous prime is 10494971. The next prime is 10494977. The reversal of 10494975 is 57949401.
10494975 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10494975 - 22 = 10494971 is a prime.
It is a super-2 number, since 2×104949752 = 220289000501250, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10494971) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1369 + ... + 4781.
It is an arithmetic number, because the mean of its divisors is an integer number (740838).
Almost surely, 210494975 is an apocalyptic number.
10494975 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10494975 is a deficient number, since it is larger than the sum of its proper divisors (7285137).
10494975 is a wasteful number, since it uses less digits than its factorization.
10494975 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3467 (or 3462 counting only the distinct ones).
The product of its (nonzero) digits is 45360, while the sum is 39.
The square root of 10494975 is about 3239.5948820802. The cubic root of 10494975 is about 218.9410195416.
The spelling of 10494975 in words is "ten million, four hundred ninety-four thousand, nine hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •