Base | Representation |
---|---|
bin | 101000001100011… |
… | …010011011111100 |
3 | 1201222220011012210 |
4 | 220030122123330 |
5 | 2340112431102 |
6 | 150525300420 |
7 | 22465550364 |
oct | 5014323374 |
9 | 1658804183 |
10 | 674342652 |
11 | 316715685 |
12 | 169a04710 |
13 | a9927c29 |
14 | 657b99a4 |
15 | 3e30536c |
hex | 2831a6fc |
674342652 has 48 divisors (see below), whose sum is σ = 1610284032. Its totient is φ = 219541440.
The previous prime is 674342651. The next prime is 674342653. The reversal of 674342652 is 256243476.
674342652 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (674342651) and next prime (674342653).
It is a self number, because there is not a number n which added to its sum of digits gives 674342652.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (674342651) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 367377 + ... + 369207.
It is an arithmetic number, because the mean of its divisors is an integer number (33547584).
Almost surely, 2674342652 is an apocalyptic number.
It is an amenable number.
674342652 is an abundant number, since it is smaller than the sum of its proper divisors (935941380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
674342652 is a wasteful number, since it uses less digits than its factorization.
674342652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2538 (or 2536 counting only the distinct ones).
The product of its digits is 241920, while the sum is 39.
The square root of 674342652 is about 25968.1083639144. The cubic root of 674342652 is about 876.9204738351.
The spelling of 674342652 in words is "six hundred seventy-four million, three hundred forty-two thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •