Base | Representation |
---|---|
bin | 101000001101011… |
… | …110100000010100 |
3 | 1202000102022200000 |
4 | 220031132200110 |
5 | 2340200341320 |
6 | 150535251300 |
7 | 22501121262 |
oct | 5015364024 |
9 | 1660368600 |
10 | 674621460 |
11 | 3168960a7 |
12 | 169b19b30 |
13 | a99c4ac6 |
14 | 6584d432 |
15 | 3e35cc90 |
hex | 2835e814 |
674621460 has 144 divisors (see below), whose sum is σ = 2140809216. Its totient is φ = 178319232.
The previous prime is 674621401. The next prime is 674621491. The reversal of 674621460 is 64126476.
It is a super-2 number, since 2×6746214602 = 910228228585063200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 616674 + ... + 617766.
Almost surely, 2674621460 is an apocalyptic number.
674621460 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 674621460, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1070404608).
674621460 is an abundant number, since it is smaller than the sum of its proper divisors (1466187756).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
674621460 is a wasteful number, since it uses less digits than its factorization.
674621460 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1244 (or 1230 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 36.
The square root of 674621460 is about 25973.4760861922. The cubic root of 674621460 is about 877.0413118864.
The spelling of 674621460 in words is "six hundred seventy-four million, six hundred twenty-one thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •