Base | Representation |
---|---|
bin | 1001101010001001110011100… |
… | …0001010100000111010000000 |
3 | 10022010111111101011222122020010 |
4 | 2122202130320022200322000 |
5 | 1203041124230241023212 |
6 | 10405310312411144520 |
7 | 263106202512035121 |
oct | 23242347012407200 |
9 | 3263444334878203 |
10 | 679666631970432 |
11 | 187620aaa969347 |
12 | 6428bb43a45140 |
13 | 23232399767142 |
14 | bdba07d22c048 |
15 | 5389a4ecce03c |
hex | 26a27382a0e80 |
679666631970432 has 64 divisors (see below), whose sum is σ = 1805410053813600. Its totient is φ = 226549826325504.
The previous prime is 679666631970377. The next prime is 679666631970439. The reversal of 679666631970432 is 234079136666976.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×6796666319704322 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (679666631970439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7085743 + ... + 37543854.
Almost surely, 2679666631970432 is an apocalyptic number.
It is an amenable number.
679666631970432 is an abundant number, since it is smaller than the sum of its proper divisors (1125743421843168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
679666631970432 is a wasteful number, since it uses less digits than its factorization.
679666631970432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44669273 (or 44669261 counting only the distinct ones).
The product of its (nonzero) digits is 2222131968, while the sum is 75.
The spelling of 679666631970432 in words is "six hundred seventy-nine trillion, six hundred sixty-six billion, six hundred thirty-one million, nine hundred seventy thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •