Base | Representation |
---|---|
bin | 101000001101… |
… | …001111100000 |
3 | 201211111011101 |
4 | 220031033200 |
5 | 10144240000 |
6 | 1013524144 |
7 | 155405602 |
oct | 50151740 |
9 | 21744141 |
10 | 10540000 |
11 | 5a49949 |
12 | 3643654 |
13 | 22505b3 |
14 | 1585172 |
15 | dd2e6a |
hex | a0d3e0 |
10540000 has 120 divisors (see below), whose sum is σ = 28340928. Its totient is φ = 3840000.
The previous prime is 10539979. The next prime is 10540001. The reversal of 10540000 is 4501.
It is a super-2 number, since 2×105400002 = 222183200000000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10540001) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 339985 + ... + 340015.
Almost surely, 210540000 is an apocalyptic number.
10540000 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 10540000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14170464).
10540000 is an abundant number, since it is smaller than the sum of its proper divisors (17800928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10540000 is an equidigital number, since it uses as much as digits as its factorization.
10540000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78 (or 55 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 10.
The square root of 10540000 is about 3246.5366161496. The cubic root of 10540000 is about 219.2536693491.
Adding to 10540000 its reverse (4501), we get a palindrome (10544501).
The spelling of 10540000 in words is "ten million, five hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •