Base | Representation |
---|---|
bin | 1010000010100… |
… | …0111000000000 |
3 | 2221020102200211 |
4 | 2200220320000 |
5 | 41240013324 |
6 | 4102323504 |
7 | 1020635014 |
oct | 240507000 |
9 | 87212624 |
10 | 42110464 |
11 | 21852240 |
12 | 12129594 |
13 | 8955346 |
14 | 5842544 |
15 | 3a6c294 |
hex | 2828e00 |
42110464 has 40 divisors (see below), whose sum is σ = 91799928. Its totient is φ = 19138560.
The previous prime is 42110443. The next prime is 42110473. The reversal of 42110464 is 46401124.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1894 + ... + 9370.
Almost surely, 242110464 is an apocalyptic number.
42110464 is a gapful number since it is divisible by the number (44) 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 42110464, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45899964).
42110464 is an abundant number, since it is smaller than the sum of its proper divisors (49689464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42110464 is an equidigital number, since it uses as much as digits as its factorization.
42110464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7506 (or 7490 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 22.
The square root of 42110464 is about 6489.2575846548. The cubic root of 42110464 is about 347.9071404151.
Adding to 42110464 its reverse (46401124), we get a palindrome (88511588).
The spelling of 42110464 in words is "forty-two million, one hundred ten thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •