Base | Representation |
---|---|
bin | 10011100100101000010… |
… | …00000100111111001001 |
3 | 2101021211200110212121201 |
4 | 21302110020010333021 |
5 | 42004240002344341 |
6 | 1232535305504201 |
7 | 66405115024612 |
oct | 11622410047711 |
9 | 2337750425551 |
10 | 672500043721 |
11 | 23a229819500 |
12 | aa402aa2061 |
13 | 4b55501b16c |
14 | 24798d1cc09 |
15 | 1275ebb7331 |
hex | 9c94204fc9 |
672500043721 has 9 divisors (see below), whose sum is σ = 739204178349. Its totient is φ = 611355475500.
The previous prime is 672500043713. The next prime is 672500043727. The reversal of 672500043721 is 127340005276.
It is a happy number.
The square root of 672500043721 is 820061.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 672500043721 - 23 = 672500043713 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (672500043727) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 8983396 + ... + 9057946.
Almost surely, 2672500043721 is an apocalyptic number.
672500043721 is the 820061-st square number.
672500043721 is the 410031-st centered octagonal number.
It is an amenable number.
672500043721 is a deficient number, since it is larger than the sum of its proper divisors (66704134628).
672500043721 is an frugal number, since it uses more digits than its factorization.
672500043721 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149124 (or 74562 counting only the distinct ones).
The product of its (nonzero) digits is 70560, while the sum is 37.
Adding to 672500043721 its reverse (127340005276), we get a palindrome (799840048997).
The spelling of 672500043721 in words is "six hundred seventy-two billion, five hundred million, forty-three thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •