Base | Representation |
---|---|
bin | 101000000101… |
… | …000010100101 |
3 | 201202210002010 |
4 | 220011002211 |
5 | 10142201110 |
6 | 1013104433 |
7 | 155205630 |
oct | 50050245 |
9 | 21683063 |
10 | 10506405 |
11 | 5a26688 |
12 | 3628119 |
13 | 223b210 |
14 | 1576c17 |
15 | dc8020 |
hex | a050a5 |
10506405 has 64 divisors (see below), whose sum is σ = 21288960. Its totient is φ = 4306176.
The previous prime is 10506383. The next prime is 10506407. The reversal of 10506405 is 50460501.
It is a happy number.
It is not a de Polignac number, because 10506405 - 27 = 10506277 is a prime.
It is a super-2 number, since 2×105064052 = 220769092048050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a zygodrome in base 4.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10506407) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 58606 + ... + 58784.
It is an arithmetic number, because the mean of its divisors is an integer number (332640).
Almost surely, 210506405 is an apocalyptic number.
10506405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10506405 is an abundant number, since it is smaller than the sum of its proper divisors (10782555).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10506405 is a wasteful number, since it uses less digits than its factorization.
10506405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 250.
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 10506405 is about 3241.3585114887. The cubic root of 10506405 is about 219.0204730553.
Adding to 10506405 its reverse (50460501), we get a palindrome (60966906).
The spelling of 10506405 in words is "ten million, five hundred six thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •