Base | Representation |
---|---|
bin | 1010000101100… |
… | …0101000111111 |
3 | 2221121101002000 |
4 | 2201120220333 |
5 | 41312243421 |
6 | 4110433343 |
7 | 1022411301 |
oct | 241305077 |
9 | 87541060 |
10 | 42306111 |
11 | 21976231 |
12 | 12202853 |
13 | 89c3403 |
14 | 5893971 |
15 | 3aaa226 |
hex | 2858a3f |
42306111 has 8 divisors (see below), whose sum is σ = 62675760. Its totient is φ = 28204056.
The previous prime is 42306101. The next prime is 42306119. The reversal of 42306111 is 11160324.
It is a happy number.
42306111 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 42306111 - 211 = 42304063 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42306119) 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, 783420 + ... + 783473.
It is an arithmetic number, because the mean of its divisors is an integer number (7834470).
Almost surely, 242306111 is an apocalyptic number.
42306111 is a deficient number, since it is larger than the sum of its proper divisors (20369649).
42306111 is a wasteful number, since it uses less digits than its factorization.
42306111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1566902 (or 1566896 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
The square root of 42306111 is about 6504.3147986548. The cubic root of 42306111 is about 348.4451052426.
Adding to 42306111 its reverse (11160324), we get a palindrome (53466435).
It can be divided in two parts, 42 and 306111, that added together give a triangular number (306153 = T782).
The spelling of 42306111 in words is "forty-two million, three hundred six thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •