Base | Representation |
---|---|
bin | 1010000001000… |
… | …0111010101101 |
3 | 2221001110002100 |
4 | 2200100322231 |
5 | 41223343313 |
6 | 4100245313 |
7 | 1020045636 |
oct | 240207255 |
9 | 87043070 |
10 | 42012333 |
11 | 21795540 |
12 | 120a0839 |
13 | 891c78c |
14 | 581888d |
15 | 3a4d173 |
hex | 2810ead |
42012333 has 48 divisors (see below), whose sum is σ = 69189120. Its totient is φ = 24343200.
The previous prime is 42012323. The next prime is 42012337. The reversal of 42012333 is 33321024.
It is not a de Polignac number, because 42012333 - 25 = 42012301 is a prime.
It is a super-2 number, since 2×420123332 = 3530072248205778, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42012337) 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 47 ways as a sum of consecutive naturals, for example, 302178 + ... + 302316.
It is an arithmetic number, because the mean of its divisors is an integer number (1441440).
Almost surely, 242012333 is an apocalyptic number.
42012333 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
It is an amenable number.
42012333 is a deficient number, since it is larger than the sum of its proper divisors (27176787).
42012333 is a wasteful number, since it uses less digits than its factorization.
42012333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270 (or 267 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
The square root of 42012333 is about 6481.6921401745. The cubic root of 42012333 is about 347.6366848388.
Adding to 42012333 its reverse (33321024), we get a palindrome (75333357).
The spelling of 42012333 in words is "forty-two million, twelve thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •