Base | Representation |
---|---|
bin | 101000001110001… |
… | …011001100111000 |
3 | 1202000202121210121 |
4 | 220032023030320 |
5 | 2340222221121 |
6 | 150543223024 |
7 | 22502513110 |
oct | 5016131470 |
9 | 1660677717 |
10 | 674804536 |
11 | 316a006aa |
12 | 169ba7a74 |
13 | a9a5a233 |
14 | 6589a040 |
15 | 3e397141 |
hex | 2838b338 |
674804536 has 16 divisors (see below), whose sum is σ = 1446009840. Its totient is φ = 289201920.
The previous prime is 674804531. The next prime is 674804549. The reversal of 674804536 is 635408476.
It is a super-2 number, since 2×6748045362 = 910722323612350592, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 674804492 and 674804501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (674804531) 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 3 ways as a sum of consecutive naturals, for example, 6024985 + ... + 6025096.
It is an arithmetic number, because the mean of its divisors is an integer number (90375615).
Almost surely, 2674804536 is an apocalyptic number.
It is an amenable number.
674804536 is an abundant number, since it is smaller than the sum of its proper divisors (771205304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
674804536 is a wasteful number, since it uses less digits than its factorization.
674804536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12050094 (or 12050090 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 43.
The square root of 674804536 is about 25977.0001347346. Note that the first 3 decimals coincide. The cubic root of 674804536 is about 877.1206406668.
The spelling of 674804536 in words is "six hundred seventy-four million, eight hundred four thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •