Base | Representation |
---|---|
bin | 100111101100… |
… | …100101110100 |
3 | 201120200201001 |
4 | 213230211310 |
5 | 10131000020 |
6 | 1011013044 |
7 | 154310644 |
oct | 47544564 |
9 | 21520631 |
10 | 10406260 |
11 | 5968417 |
12 | 359a184 |
13 | 2204767 |
14 | 154c524 |
15 | da850a |
hex | 9ec974 |
10406260 has 12 divisors (see below), whose sum is σ = 21853188. Its totient is φ = 4162496.
The previous prime is 10406219. The next prime is 10406267. The reversal of 10406260 is 6260401.
It can be written as a sum of positive squares in 2 ways, for example, as 5143824 + 5262436 = 2268^2 + 2294^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10406267) 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, 260137 + ... + 260176.
It is an arithmetic number, because the mean of its divisors is an integer number (1821099).
Almost surely, 210406260 is an apocalyptic number.
10406260 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10406260 is an abundant number, since it is smaller than the sum of its proper divisors (11446928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10406260 is a wasteful number, since it uses less digits than its factorization.
10406260 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 520322 (or 520320 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 10406260 is about 3225.8735251091. The cubic root of 10406260 is about 218.3223634654.
Adding to 10406260 its reverse (6260401), we get a palindrome (16666661).
The spelling of 10406260 in words is "ten million, four hundred six thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •