Base | Representation |
---|---|
bin | 1010100000100101… |
… | …00001011111000111 |
3 | 112120012102022110002 |
4 | 11100102201133013 |
5 | 43023323002302 |
6 | 2331503351515 |
7 | 256546132355 |
oct | 52022413707 |
9 | 15505368402 |
10 | 5642000327 |
11 | 2435842397 |
12 | 11155b259b |
13 | 6bbb71642 |
14 | 3b745c7d5 |
15 | 2304bdc02 |
hex | 1504a17c7 |
5642000327 has 4 divisors (see below), whose sum is σ = 5642419536. Its totient is φ = 5641581120.
The previous prime is 5642000297. The next prime is 5642000347. The reversal of 5642000327 is 7230002465.
5642000327 is digitally balanced in base 3, 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 a cyclic number.
It is not a de Polignac number, because 5642000327 - 26 = 5642000263 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5642000327.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5642000347) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 188723 + ... + 216564.
It is an arithmetic number, because the mean of its divisors is an integer number (1410604884).
Almost surely, 25642000327 is an apocalyptic number.
5642000327 is a deficient number, since it is larger than the sum of its proper divisors (419209).
5642000327 is a wasteful number, since it uses less digits than its factorization.
5642000327 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419208.
The product of its (nonzero) digits is 10080, while the sum is 29.
The square root of 5642000327 is about 75113.2500095689. The cubic root of 5642000327 is about 1780.2365051020.
The spelling of 5642000327 in words is "five billion, six hundred forty-two million, three hundred twenty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •