Base | Representation |
---|---|
bin | 1010001001111… |
… | …1000101010011 |
3 | 2222011000212101 |
4 | 2202133011103 |
5 | 41401012033 |
6 | 4120541231 |
7 | 1025022430 |
oct | 242370523 |
9 | 88130771 |
10 | 42594643 |
11 | 22052a93 |
12 | 12321817 |
13 | 8a94840 |
14 | 592ab87 |
15 | 3b1597d |
hex | 289f153 |
42594643 has 32 divisors (see below), whose sum is σ = 55996416. Its totient is φ = 31477248.
The previous prime is 42594641. The next prime is 42594677. The reversal of 42594643 is 34649524.
It is a happy number.
42594643 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 42594643 - 21 = 42594641 is a prime.
It is a super-2 number, since 2×425946432 = 3628607224594898, which contains 22 as substring.
It is a Smith number, since the sum of its digits (37) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (42594641) 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 31 ways as a sum of consecutive naturals, for example, 98155 + ... + 98587.
It is an arithmetic number, because the mean of its divisors is an integer number (1749888).
Almost surely, 242594643 is an apocalyptic number.
42594643 is a deficient number, since it is larger than the sum of its proper divisors (13401773).
42594643 is a wasteful number, since it uses less digits than its factorization.
42594643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 523.
The product of its digits is 103680, while the sum is 37.
The square root of 42594643 is about 6526.4571553026. The cubic root of 42594643 is about 349.2354549423.
The spelling of 42594643 in words is "forty-two million, five hundred ninety-four thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •