Base | Representation |
---|---|
bin | 101000000000110… |
… | …111011111100110 |
3 | 1201210012101100102 |
4 | 220000313133212 |
5 | 2333324102232 |
6 | 150340344102 |
7 | 22431043223 |
oct | 5000673746 |
9 | 1653171312 |
10 | 671315942 |
11 | 314a38670 |
12 | 1689a5032 |
13 | a910838b |
14 | 6522c94a |
15 | 3de08662 |
hex | 280377e6 |
671315942 has 32 divisors (see below), whose sum is σ = 1158192000. Its totient is φ = 288619200.
The previous prime is 671315917. The next prime is 671315959. The reversal of 671315942 is 249513176.
671315942 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (38) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Harshad number since it is a multiple of its sum of digits (38).
It is a junction number, because it is equal to n+sod(n) for n = 671315896 and 671315905.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 437717 + ... + 439247.
It is an arithmetic number, because the mean of its divisors is an integer number (36193500).
Almost surely, 2671315942 is an apocalyptic number.
671315942 is a deficient number, since it is larger than the sum of its proper divisors (486876058).
671315942 is a wasteful number, since it uses less digits than its factorization.
671315942 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2612.
The product of its digits is 45360, while the sum is 38.
The square root of 671315942 is about 25909.7653790998. The cubic root of 671315942 is about 875.6065202184.
It can be divided in two parts, 671 and 315942, that added together give a palindrome (316613).
The spelling of 671315942 in words is "six hundred seventy-one million, three hundred fifteen thousand, nine hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •