Base | Representation |
---|---|
bin | 101000011110101… |
… | …111000000000000 |
3 | 1202022221011110000 |
4 | 220132233000000 |
5 | 2342330123342 |
6 | 151220240000 |
7 | 22554432645 |
oct | 5036570000 |
9 | 1668834400 |
10 | 679145472 |
11 | 3193a6055 |
12 | 16b540000 |
13 | aa91a035 |
14 | 662a9dcc |
15 | 3e95344c |
hex | 287af000 |
679145472 has 260 divisors, whose sum is σ = 2140799760. Its totient is φ = 214106112.
The previous prime is 679145447. The next prime is 679145473. The reversal of 679145472 is 274541976.
It is a super-3 number, since 3×6791454723 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (679145473) 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 19 ways as a sum of consecutive naturals, for example, 7630804 + ... + 7630892.
Almost surely, 2679145472 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 679145472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1070399880).
679145472 is an abundant number, since it is smaller than the sum of its proper divisors (1461654288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
679145472 is an equidigital number, since it uses as much as digits as its factorization.
679145472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148 (or 117 counting only the distinct ones).
The product of its digits is 423360, while the sum is 45.
The square root of 679145472 is about 26060.4196435898. The cubic root of 679145472 is about 878.9974257050.
The spelling of 679145472 in words is "six hundred seventy-nine million, one hundred forty-five thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •