Base | Representation |
---|---|
bin | 100111101101… |
… | …101111111111 |
3 | 201120221012212 |
4 | 213231233333 |
5 | 10131123012 |
6 | 1011051035 |
7 | 154330535 |
oct | 47555777 |
9 | 21527185 |
10 | 10411007 |
11 | 5970a42 |
12 | 35a0a7b |
13 | 2206979 |
14 | 1550155 |
15 | da9b22 |
hex | 9edbff |
10411007 has 8 divisors (see below), whose sum is σ = 10715712. Its totient is φ = 10108800.
The previous prime is 10411003. The next prime is 10411013. The reversal of 10411007 is 70011401.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10411007 - 22 = 10411003 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10410982 and 10411000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10411001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10643 + ... + 11579.
It is an arithmetic number, because the mean of its divisors is an integer number (1339464).
Almost surely, 210411007 is an apocalyptic number.
10411007 is a deficient number, since it is larger than the sum of its proper divisors (304705).
10411007 is an equidigital number, since it uses as much as digits as its factorization.
10411007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1249.
The product of its (nonzero) digits is 28, while the sum is 14.
The square root of 10411007 is about 3226.6092109210. The cubic root of 10411007 is about 218.3555556245.
Adding to 10411007 its reverse (70011401), we get a palindrome (80422408).
It can be divided in two parts, 1041 and 1007, that added together give a 11-th power (2048 = 211).
The spelling of 10411007 in words is "ten million, four hundred eleven thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •