Base | Representation |
---|---|
bin | 1010001010000… |
… | …1111011110001 |
3 | 2222011121212220 |
4 | 2202201323301 |
5 | 41401400241 |
6 | 4121111253 |
7 | 1025101452 |
oct | 242417361 |
9 | 88147786 |
10 | 42606321 |
11 | 2206083a |
12 | 12328529 |
13 | 8a99c54 |
14 | 5931129 |
15 | 3b19166 |
hex | 28a1ef1 |
42606321 has 8 divisors (see below), whose sum is σ = 56839680. Its totient is φ = 28388592.
The previous prime is 42606293. The next prime is 42606323. The reversal of 42606321 is 12360624.
42606321 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 42606321 - 211 = 42604273 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 42606291 and 42606300.
It is not an unprimeable number, because it can be changed into a prime (42606323) 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, 6171 + ... + 11103.
It is an arithmetic number, because the mean of its divisors is an integer number (7104960).
Almost surely, 242606321 is an apocalyptic number.
It is an amenable number.
42606321 is a deficient number, since it is larger than the sum of its proper divisors (14233359).
42606321 is a wasteful number, since it uses less digits than its factorization.
42606321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7815.
The product of its (nonzero) digits is 1728, while the sum is 24.
The square root of 42606321 is about 6527.3517600938. The cubic root of 42606321 is about 349.2673681806.
Adding to 42606321 its reverse (12360624), we get a palindrome (54966945).
The spelling of 42606321 in words is "forty-two million, six hundred six thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •