Base | Representation |
---|---|
bin | 101000001110011… |
… | …010010100001000 |
3 | 1202000212202201100 |
4 | 220032122110020 |
5 | 2340231211230 |
6 | 150544421400 |
7 | 22503161433 |
oct | 5016322410 |
9 | 1660782640 |
10 | 674866440 |
11 | 316a43166 |
12 | 16a017860 |
13 | a9a7c471 |
14 | 658b481a |
15 | 3e3aa660 |
hex | 2839a508 |
674866440 has 48 divisors (see below), whose sum is σ = 2193317100. Its totient is φ = 179964288.
The previous prime is 674866417. The next prime is 674866463. The reversal of 674866440 is 44668476.
It is an interprime number because it is at equal distance from previous prime (674866417) and next prime (674866463).
It can be written as a sum of positive squares in 2 ways, for example, as 569967876 + 104898564 = 23874^2 + 10242^2 .
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 936955 + ... + 937674.
Almost surely, 2674866440 is an apocalyptic number.
674866440 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
674866440 is an abundant number, since it is smaller than the sum of its proper divisors (1518450660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
674866440 is a wasteful number, since it uses less digits than its factorization.
674866440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1874646 (or 1874639 counting only the distinct ones).
The product of its (nonzero) digits is 774144, while the sum is 45.
The square root of 674866440 is about 25978.1916229748. The cubic root of 674866440 is about 877.1474610832.
The spelling of 674866440 in words is "six hundred seventy-four million, eight hundred sixty-six thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •