Base | Representation |
---|---|
bin | 1010000010000… |
… | …0010100101000 |
3 | 2221011122122100 |
4 | 2200200110220 |
5 | 41232403212 |
6 | 4101453400 |
7 | 1020430620 |
oct | 240402450 |
9 | 87148570 |
10 | 42075432 |
11 | 21828993 |
12 | 12111260 |
13 | 8942409 |
14 | 5833880 |
15 | 3a61bdc |
hex | 2820528 |
42075432 has 96 divisors (see below), whose sum is σ = 134484480. Its totient is φ = 11629440.
The previous prime is 42075413. The next prime is 42075499. The reversal of 42075432 is 23457024.
It is a junction number, because it is equal to n+sod(n) for n = 42075396 and 42075405.
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 23 ways as a sum of consecutive naturals, for example, 14278 + ... + 16970.
It is an arithmetic number, because the mean of its divisors is an integer number (1400880).
Almost surely, 242075432 is an apocalyptic number.
42075432 is a gapful number since it is divisible by the number (42) 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 42075432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67242240).
42075432 is an abundant number, since it is smaller than the sum of its proper divisors (92409048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42075432 is a wasteful number, since it uses less digits than its factorization.
42075432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2743 (or 2736 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 27.
The square root of 42075432 is about 6486.5577928513. The cubic root of 42075432 is about 347.8106381599.
The spelling of 42075432 in words is "forty-two million, seventy-five thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •