Base | Representation |
---|---|
bin | 1100100100011… |
… | …10001100000000 |
3 | 21100101220111012 |
4 | 12102032030000 |
5 | 203443040000 |
6 | 14243540052 |
7 | 2420140151 |
oct | 622161400 |
9 | 240356435 |
10 | 105440000 |
11 | 545776a6 |
12 | 2b38a628 |
13 | 18ac9943 |
14 | 10009928 |
15 | 93cb735 |
hex | 648e300 |
105440000 has 90 divisors (see below), whose sum is σ = 263400060. Its totient is φ = 42112000.
The previous prime is 105439993. The next prime is 105440003. The reversal of 105440000 is 44501.
It is a super-2 number, since 2×1054400002 = 22235187200000000, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105440003) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 159671 + ... + 160329.
Almost surely, 2105440000 is an apocalyptic number.
105440000 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 105440000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (131700030).
105440000 is an abundant number, since it is smaller than the sum of its proper divisors (157960060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105440000 is an frugal number, since it uses more digits than its factorization.
105440000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 695 (or 666 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 14.
The square root of 105440000 is about 10268.3981223947. The cubic root of 105440000 is about 472.4274591659.
Adding to 105440000 its reverse (44501), we get a palindrome (105484501).
The spelling of 105440000 in words is "one hundred five million, four hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •