Base | Representation |
---|---|
bin | 101000000001… |
… | …111001001001 |
3 | 201202010101122 |
4 | 220001321021 |
5 | 10141243023 |
6 | 1012525025 |
7 | 155123222 |
oct | 50017111 |
9 | 21663348 |
10 | 10493513 |
11 | 5a17a28 |
12 | 3620775 |
13 | 22353a4 |
14 | 1572249 |
15 | dc42c8 |
hex | a01e49 |
10493513 has 4 divisors (see below), whose sum is σ = 10500048. Its totient is φ = 10486980.
The previous prime is 10493507. The next prime is 10493521. The reversal of 10493513 is 31539401.
10493513 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 10493513 - 26 = 10493449 is a prime.
It is a super-2 number, since 2×104935132 = 220227630162338, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10493503) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 998 + ... + 4688.
It is an arithmetic number, because the mean of its divisors is an integer number (2625012).
Almost surely, 210493513 is an apocalyptic number.
It is an amenable number.
10493513 is a deficient number, since it is larger than the sum of its proper divisors (6535).
10493513 is an equidigital number, since it uses as much as digits as its factorization.
10493513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6534.
The product of its (nonzero) digits is 1620, while the sum is 26.
The square root of 10493513 is about 3239.3692287234. The cubic root of 10493513 is about 218.9308525606.
The spelling of 10493513 in words is "ten million, four hundred ninety-three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •