Base | Representation |
---|---|
bin | 101000000001… |
… | …000011010111 |
3 | 201201221200011 |
4 | 220001003113 |
5 | 10141140241 |
6 | 1012501051 |
7 | 155110204 |
oct | 50010327 |
9 | 21657604 |
10 | 10490071 |
11 | 5a15389 |
12 | 361a787 |
13 | 2233957 |
14 | 1570cab |
15 | dc3281 |
hex | a010d7 |
10490071 has 16 divisors (see below), whose sum is σ = 11957760. Its totient is φ = 9141120.
The previous prime is 10490069. The next prime is 10490089. The reversal of 10490071 is 17009401.
10490071 = T2643 + T2644 + T2645.
10490071 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a 7-Lehmer number, since φ(10490071) divides (10490071-1)7.
It is a cyclic number.
It is not a de Polignac number, because 10490071 - 21 = 10490069 is a prime.
It is a super-2 number, since 2×104900712 = 220083179170082, 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 (10490041) 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, 14836 + ... + 15526.
It is an arithmetic number, because the mean of its divisors is an integer number (747360).
Almost surely, 210490071 is an apocalyptic number.
10490071 is the 2645-th centered triangular number.
10490071 is a deficient number, since it is larger than the sum of its proper divisors (1467689).
10490071 is a wasteful number, since it uses less digits than its factorization.
10490071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 774.
The product of its (nonzero) digits is 252, while the sum is 22.
The square root of 10490071 is about 3238.8379088803. The cubic root of 10490071 is about 218.9069126146.
Adding to 10490071 its reverse (17009401), we get a palindrome (27499472).
The spelling of 10490071 in words is "ten million, four hundred ninety thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •