Base | Representation |
---|---|
bin | 100111101100… |
… | …010100000000 |
3 | 201120122010211 |
4 | 213230110000 |
5 | 10130430440 |
6 | 1011003504 |
7 | 154304425 |
oct | 47542400 |
9 | 21518124 |
10 | 10405120 |
11 | 5967580 |
12 | 3599594 |
13 | 220409b |
14 | 154bd4c |
15 | da7eea |
hex | 9ec500 |
10405120 has 72 divisors (see below), whose sum is σ = 27226080. Its totient is φ = 3778560.
The previous prime is 10405111. The next prime is 10405133. The reversal of 10405120 is 2150401.
It is a self number, because there is not a number n which added to its sum of digits gives 10405120.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13711 + ... + 14449.
It is an arithmetic number, because the mean of its divisors is an integer number (378140).
Almost surely, 210405120 is an apocalyptic number.
10405120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10405120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13613040).
10405120 is an abundant number, since it is smaller than the sum of its proper divisors (16820960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10405120 is an equidigital number, since it uses as much as digits as its factorization.
10405120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 771 (or 757 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 13.
The square root of 10405120 is about 3225.6968239436. The cubic root of 10405120 is about 218.3143908098.
Adding to 10405120 its reverse (2150401), we get a palindrome (12555521).
The spelling of 10405120 in words is "ten million, four hundred five thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •