Base | Representation |
---|---|
bin | 101000000001011… |
… | …101110101110011 |
3 | 1201210111100210210 |
4 | 220001131311303 |
5 | 2333344114021 |
6 | 150343555203 |
7 | 22432266156 |
oct | 5001356563 |
9 | 1653440723 |
10 | 671473011 |
11 | 315035680 |
12 | 168a5bb03 |
13 | a9161a11 |
14 | 6526dc9d |
15 | 3de39e76 |
hex | 2805dd73 |
671473011 has 8 divisors (see below), whose sum is σ = 976688064. Its totient is φ = 406953320.
The previous prime is 671472979. The next prime is 671473013. The reversal of 671473011 is 110374176.
671473011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 671473011 - 25 = 671472979 is a prime.
It is a super-2 number, since 2×6714730112 = 901752009002812242, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 671473011.
It is not an unprimeable number, because it can be changed into a prime (671473013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10173801 + ... + 10173866.
It is an arithmetic number, because the mean of its divisors is an integer number (122086008).
Almost surely, 2671473011 is an apocalyptic number.
671473011 is a deficient number, since it is larger than the sum of its proper divisors (305215053).
671473011 is a wasteful number, since it uses less digits than its factorization.
671473011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20347681.
The product of its (nonzero) digits is 3528, while the sum is 30.
The square root of 671473011 is about 25912.7962790587. The cubic root of 671473011 is about 875.6748039713.
The spelling of 671473011 in words is "six hundred seventy-one million, four hundred seventy-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •