Base | Representation |
---|---|
bin | 100111111101… |
… | …100010100001 |
3 | 201201012221012 |
4 | 213331202201 |
5 | 10140210211 |
6 | 1012310305 |
7 | 155020226 |
oct | 47754241 |
9 | 21635835 |
10 | 10475681 |
11 | 5a05597 |
12 | 3612395 |
13 | 222a238 |
14 | 156994d |
15 | dbdd8b |
hex | 9fd8a1 |
10475681 has 4 divisors (see below), whose sum is σ = 10488000. Its totient is φ = 10463364.
The previous prime is 10475671. The next prime is 10475683. The reversal of 10475681 is 18657401.
It is a happy number.
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 an emirpimes, since its reverse is a distinct semiprime: 18657401 = 7 ⋅2665343.
It is a cyclic number.
It is not a de Polignac number, because 10475681 - 214 = 10459297 is a prime.
It is a super-2 number, since 2×104756812 = 219479784827522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10475683) 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 3 ways as a sum of consecutive naturals, for example, 4781 + ... + 6618.
It is an arithmetic number, because the mean of its divisors is an integer number (2622000).
Almost surely, 210475681 is an apocalyptic number.
It is an amenable number.
10475681 is a deficient number, since it is larger than the sum of its proper divisors (12319).
10475681 is an equidigital number, since it uses as much as digits as its factorization.
10475681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12318.
The product of its (nonzero) digits is 6720, while the sum is 32.
The square root of 10475681 is about 3236.6156707277. The cubic root of 10475681 is about 218.8067699189.
The spelling of 10475681 in words is "ten million, four hundred seventy-five thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •