Base | Representation |
---|---|
bin | 1010000101101… |
… | …0010101110101 |
3 | 2221121201122000 |
4 | 2201122111311 |
5 | 41313004302 |
6 | 4110525513 |
7 | 1022440512 |
oct | 241322565 |
9 | 87551560 |
10 | 42313077 |
11 | 21980494 |
12 | 12206899 |
13 | 89c6631 |
14 | 5896309 |
15 | 3aac31c |
hex | 285a575 |
42313077 has 32 divisors (see below), whose sum is σ = 66543360. Its totient is φ = 26516160.
The previous prime is 42313067. The next prime is 42313081. The reversal of 42313077 is 77031324.
42313077 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 42313077 - 26 = 42313013 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 42313077.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42313067) 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, 37323 + ... + 38439.
It is an arithmetic number, because the mean of its divisors is an integer number (2079480).
Almost surely, 242313077 is an apocalyptic number.
It is an amenable number.
42313077 is a deficient number, since it is larger than the sum of its proper divisors (24230283).
42313077 is a wasteful number, since it uses less digits than its factorization.
42313077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1210 (or 1204 counting only the distinct ones).
The product of its (nonzero) digits is 3528, while the sum is 27.
The square root of 42313077 is about 6504.8502673005. The cubic root of 42313077 is about 348.4642288423.
The spelling of 42313077 in words is "forty-two million, three hundred thirteen thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •