Base | Representation |
---|---|
bin | 1010001010001… |
… | …0100111110101 |
3 | 2222011202202100 |
4 | 2202202213311 |
5 | 41401443031 |
6 | 4121132313 |
7 | 1025112621 |
oct | 242424765 |
9 | 88152670 |
10 | 42609141 |
11 | 22062973 |
12 | 1232a099 |
13 | 8a9b313 |
14 | 5932181 |
15 | 3b19de6 |
hex | 28a29f5 |
42609141 has 6 divisors (see below), whose sum is σ = 61546550. Its totient is φ = 28406088.
The previous prime is 42609139. The next prime is 42609167. The reversal of 42609141 is 14190624.
42609141 is a `hidden beast` number, since 42 + 609 + 14 + 1 = 666.
42609141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 27562500 + 15046641 = 5250^2 + 3879^2 .
It is not a de Polignac number, because 42609141 - 21 = 42609139 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42609101) 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 5 ways as a sum of consecutive naturals, for example, 2367166 + ... + 2367183.
Almost surely, 242609141 is an apocalyptic number.
It is an amenable number.
42609141 is a deficient number, since it is larger than the sum of its proper divisors (18937409).
42609141 is a wasteful number, since it uses less digits than its factorization.
42609141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4734355 (or 4734352 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The square root of 42609141 is about 6527.5677706172. The cubic root of 42609141 is about 349.2750737059.
Adding to 42609141 its reverse (14190624), we get a palindrome (56799765).
The spelling of 42609141 in words is "forty-two million, six hundred nine thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •