Base | Representation |
---|---|
bin | 1010001011000… |
… | …0000000000000 |
3 | 2222021112220210 |
4 | 2202300000000 |
5 | 41410221221 |
6 | 4122234120 |
7 | 1025431440 |
oct | 242600000 |
9 | 88245823 |
10 | 42663936 |
11 | 220a0057 |
12 | 12355940 |
13 | 8aba243 |
14 | 5948120 |
15 | 3b2b276 |
hex | 28b0000 |
42663936 has 136 divisors (see below), whose sum is σ = 134216704. Its totient is φ = 11796480.
The previous prime is 42663917. The next prime is 42663937. The reversal of 42663936 is 63936624.
It is a super-2 number, since 2×426639362 = 3640422870024192, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 42663894 and 42663903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42663937) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1376241 + ... + 1376271.
Almost surely, 242663936 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 42663936, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67108352).
42663936 is an abundant number, since it is smaller than the sum of its proper divisors (91552768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42663936 is an frugal number, since it uses more digits than its factorization.
42663936 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73 (or 43 counting only the distinct ones).
The product of its digits is 139968, while the sum is 39.
The square root of 42663936 is about 6531.7636209526. The cubic root of 42663936 is about 349.4247311822.
The spelling of 42663936 in words is "forty-two million, six hundred sixty-three thousand, nine hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •