Base | Representation |
---|---|
bin | 101000000001… |
… | …101111100101 |
3 | 201202002112222 |
4 | 220001233211 |
5 | 10141233101 |
6 | 1012522125 |
7 | 155121356 |
oct | 50015745 |
9 | 21662488 |
10 | 10492901 |
11 | 5a17521 |
12 | 3620345 |
13 | 2235023 |
14 | 1571d2d |
15 | dc401b |
hex | a01be5 |
10492901 has 4 divisors (see below), whose sum is σ = 10500000. Its totient is φ = 10485804.
The previous prime is 10492879. The next prime is 10492907. The reversal of 10492901 is 10929401.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 10492901 - 26 = 10492837 is a prime.
It is a super-2 number, since 2×104929012 = 220201942791602, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10492907) 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 3 ways as a sum of consecutive naturals, for example, 401 + ... + 4598.
It is an arithmetic number, because the mean of its divisors is an integer number (2625000).
Almost surely, 210492901 is an apocalyptic number.
It is an amenable number.
10492901 is a deficient number, since it is larger than the sum of its proper divisors (7099).
10492901 is an equidigital number, since it uses as much as digits as its factorization.
10492901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7098.
The product of its (nonzero) digits is 648, while the sum is 26.
The square root of 10492901 is about 3239.2747645113. The cubic root of 10492901 is about 218.9265963346.
The spelling of 10492901 in words is "ten million, four hundred ninety-two thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •