Base | Representation |
---|---|
bin | 100100000001010… |
… | …001010000110111 |
3 | 1120010010021002022 |
4 | 210001101100313 |
5 | 2214201001011 |
6 | 135544303355 |
7 | 20655400256 |
oct | 4401212067 |
9 | 1503107068 |
10 | 604312631 |
11 | 29013402a |
12 | 14a471b5b |
13 | 98278850 |
14 | 5a38a79d |
15 | 380c08db |
hex | 24051437 |
604312631 has 4 divisors (see below), whose sum is σ = 650798232. Its totient is φ = 557827032.
The previous prime is 604312591. The next prime is 604312663. The reversal of 604312631 is 136213406.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-604312631 is a prime.
It is a super-2 number, since 2×6043126312 = 730387511972284322, which contains 22 as substring.
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 604312631.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (604312931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23242781 + ... + 23242806.
It is an arithmetic number, because the mean of its divisors is an integer number (162699558).
Almost surely, 2604312631 is an apocalyptic number.
604312631 is a deficient number, since it is larger than the sum of its proper divisors (46485601).
604312631 is a wasteful number, since it uses less digits than its factorization.
604312631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46485600.
The product of its (nonzero) digits is 2592, while the sum is 26.
The square root of 604312631 is about 24582.7710195576. The cubic root of 604312631 is about 845.4486284078.
The spelling of 604312631 in words is "six hundred four million, three hundred twelve thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •