Base | Representation |
---|---|
bin | 101000000001… |
… | …000111111011 |
3 | 201201222001222 |
4 | 220001013323 |
5 | 10141142423 |
6 | 1012502255 |
7 | 155111102 |
oct | 50010773 |
9 | 21658058 |
10 | 10490363 |
11 | 5a15624 |
12 | 361a98b |
13 | 2233b20 |
14 | 1571039 |
15 | dc33c8 |
hex | a011fb |
10490363 has 4 divisors (see below), whose sum is σ = 11297328. Its totient is φ = 9683400.
The previous prime is 10490357. The next prime is 10490371. The reversal of 10490363 is 36309401.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10490363 - 218 = 10228219 is a prime.
It is a super-2 number, since 2×104903632 = 220095431743538, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10490393) 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, 403463 + ... + 403488.
It is an arithmetic number, because the mean of its divisors is an integer number (2824332).
Almost surely, 210490363 is an apocalyptic number.
10490363 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10490363 is a deficient number, since it is larger than the sum of its proper divisors (806965).
10490363 is an equidigital number, since it uses as much as digits as its factorization.
10490363 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 806964.
The product of its (nonzero) digits is 1944, while the sum is 26.
The square root of 10490363 is about 3238.8829864631. The cubic root of 10490363 is about 218.9089437488.
Adding to 10490363 its reverse (36309401), we get a palindrome (46799764).
The spelling of 10490363 in words is "ten million, four hundred ninety thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •