Base | Representation |
---|---|
bin | 1010001000111… |
… | …0100011010100 |
3 | 2222000120222120 |
4 | 2202032203110 |
5 | 41341330212 |
6 | 4115255540 |
7 | 1024321140 |
oct | 242164324 |
9 | 88016876 |
10 | 42526932 |
11 | 22007128 |
12 | 122aa5b0 |
13 | 8a6ca86 |
14 | 5910220 |
15 | 3b0088c |
hex | 288e8d4 |
42526932 has 48 divisors (see below), whose sum is σ = 113809920. Its totient is φ = 12107232.
The previous prime is 42526919. The next prime is 42526933. The reversal of 42526932 is 23962524.
It is a super-3 number, since 3×425269323 (a number of 24 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 42526893 and 42526902.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42526933) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28419 + ... + 29877.
It is an arithmetic number, because the mean of its divisors is an integer number (2371040).
Almost surely, 242526932 is an apocalyptic number.
42526932 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
42526932 is an abundant number, since it is smaller than the sum of its proper divisors (71282988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42526932 is a wasteful number, since it uses less digits than its factorization.
42526932 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1820 (or 1818 counting only the distinct ones).
The product of its digits is 25920, while the sum is 33.
The square root of 42526932 is about 6521.2676681762. The cubic root of 42526932 is about 349.0503015867.
The spelling of 42526932 in words is "forty-two million, five hundred twenty-six thousand, nine hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •