Base | Representation |
---|---|
bin | 10011100010010101111… |
… | …10000011101100001000 |
3 | 2101011200010222100101112 |
4 | 21301022332003230020 |
5 | 41444231301231300 |
6 | 1232213423105452 |
7 | 66332522431403 |
oct | 11611276035410 |
9 | 2334603870345 |
10 | 671272680200 |
11 | 239759a23091 |
12 | aa11ba42288 |
13 | 4b3ba965a65 |
14 | 246bdd08d3a |
15 | 126dc073e35 |
hex | 9c4af83b08 |
671272680200 has 96 divisors (see below), whose sum is σ = 1615692069000. Its totient is φ = 259062988800.
The previous prime is 671272680181. The next prime is 671272680203. The reversal of 671272680200 is 2086272176.
It can be written as a sum of positive squares in 12 ways, for example, as 66334062916 + 604938617284 = 257554^2 + 777778^2 .
It is a super-2 number, since 2×6712726802002 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (671272680203) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8131130 + ... + 8213270.
Almost surely, 2671272680200 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 671272680200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (807846034500).
671272680200 is an abundant number, since it is smaller than the sum of its proper divisors (944419388800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
671272680200 is a wasteful number, since it uses less digits than its factorization.
671272680200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83595 (or 83586 counting only the distinct ones).
The product of its (nonzero) digits is 112896, while the sum is 41.
The spelling of 671272680200 in words is "six hundred seventy-one billion, two hundred seventy-two million, six hundred eighty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •