Base | Representation |
---|---|
bin | 101000011111001… |
… | …101110100100000 |
3 | 1202100011120121120 |
4 | 220133031310200 |
5 | 2342343143322 |
6 | 151223052240 |
7 | 22555500000 |
oct | 5037156440 |
9 | 1670146546 |
10 | 679271712 |
11 | 319481989 |
12 | 16b5a1080 |
13 | aa962632 |
14 | 66300000 |
15 | 3e97aa5c |
hex | 287cdd20 |
679271712 has 144 divisors (see below), whose sum is σ = 2085193152. Its totient is φ = 193616640.
The previous prime is 679271651. The next prime is 679271729. The reversal of 679271712 is 217172976.
It is a super-2 number, since 2×6792717122 = 922820117446821888, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a nialpdrome in base 14.
It is a zygodrome in base 7.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1613262 + ... + 1613682.
It is an arithmetic number, because the mean of its divisors is an integer number (14480508).
Almost surely, 2679271712 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 679271712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1042596576).
679271712 is an abundant number, since it is smaller than the sum of its proper divisors (1405921440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
679271712 is an frugal number, since it uses more digits than its factorization.
679271712 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 469 (or 433 counting only the distinct ones).
The product of its digits is 74088, while the sum is 42.
The square root of 679271712 is about 26062.8415948837. The cubic root of 679271712 is about 879.0518852010.
The spelling of 679271712 in words is "six hundred seventy-nine million, two hundred seventy-one thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •