Base | Representation |
---|---|
bin | 1010000110011… |
… | …1001011001011 |
3 | 2221201101201220 |
4 | 2201213023023 |
5 | 41321200033 |
6 | 4112013123 |
7 | 1023046665 |
oct | 241471313 |
9 | 87641656 |
10 | 42365643 |
11 | 21a06a31 |
12 | 122311a3 |
13 | 8a14538 |
14 | 58ab535 |
15 | 3abcbb3 |
hex | 28672cb |
42365643 has 4 divisors (see below), whose sum is σ = 56487528. Its totient is φ = 28243760.
The previous prime is 42365639. The next prime is 42365647. The reversal of 42365643 is 34656324.
42365643 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (42365639) and next prime (42365647).
It is a cyclic number.
It is not a de Polignac number, because 42365643 - 22 = 42365639 is a prime.
It is not an unprimeable number, because it can be changed into a prime (42365647) 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 3 ways as a sum of consecutive naturals, for example, 7060938 + ... + 7060943.
It is an arithmetic number, because the mean of its divisors is an integer number (14121882).
Almost surely, 242365643 is an apocalyptic number.
42365643 is a deficient number, since it is larger than the sum of its proper divisors (14121885).
42365643 is a wasteful number, since it uses less digits than its factorization.
42365643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14121884.
The product of its digits is 51840, while the sum is 33.
The square root of 42365643 is about 6508.8895366260. The cubic root of 42365643 is about 348.6084694404.
It can be divided in two parts, 423 and 65643, that added together give a palindrome (66066).
The spelling of 42365643 in words is "forty-two million, three hundred sixty-five thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •