Base | Representation |
---|---|
bin | 1010000111010… |
… | …0011110011001 |
3 | 2221211011110121 |
4 | 2201310132121 |
5 | 41324420441 |
6 | 4113113241 |
7 | 1023364552 |
oct | 241643631 |
9 | 87734417 |
10 | 42420121 |
11 | 21a43957 |
12 | 12258821 |
13 | 8a33283 |
14 | 58c3329 |
15 | 3acddd1 |
hex | 2874799 |
42420121 has 8 divisors (see below), whose sum is σ = 43865600. Its totient is φ = 40979520.
The previous prime is 42420109. The next prime is 42420181. The reversal of 42420121 is 12102424.
42420121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 42420121 - 221 = 40322969 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 42420095 and 42420104.
It is not an unprimeable number, because it can be changed into a prime (42420181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27745 + ... + 29233.
It is an arithmetic number, because the mean of its divisors is an integer number (5483200).
Almost surely, 242420121 is an apocalyptic number.
It is an amenable number.
42420121 is a deficient number, since it is larger than the sum of its proper divisors (1445479).
42420121 is a wasteful number, since it uses less digits than its factorization.
42420121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2439.
The product of its (nonzero) digits is 128, while the sum is 16.
The square root of 42420121 is about 6513.0730841900. The cubic root of 42420121 is about 348.7578307016.
Adding to 42420121 its reverse (12102424), we get a palindrome (54522545).
The spelling of 42420121 in words is "forty-two million, four hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •