Base | Representation |
---|---|
bin | 100111111111110… |
… | …000101101111101 |
3 | 1201202122122200111 |
4 | 213333300231331 |
5 | 2333240313140 |
6 | 150330230021 |
7 | 22425425104 |
oct | 4777605575 |
9 | 1652578614 |
10 | 671026045 |
11 | 31485a888 |
12 | 168885311 |
13 | a9036441 |
14 | 6519503b |
15 | 3dd9c7ea |
hex | 27ff0b7d |
671026045 has 4 divisors (see below), whose sum is σ = 805231260. Its totient is φ = 536820832.
The previous prime is 671026019. The next prime is 671026063. The reversal of 671026045 is 540620176.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 324396121 + 346629924 = 18011^2 + 18618^2 .
It is a cyclic number.
It is not a de Polignac number, because 671026045 - 215 = 670993277 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 671025998 and 671026016.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 67102600 + ... + 67102609.
It is an arithmetic number, because the mean of its divisors is an integer number (201307815).
Almost surely, 2671026045 is an apocalyptic number.
It is an amenable number.
671026045 is a deficient number, since it is larger than the sum of its proper divisors (134205215).
671026045 is a wasteful number, since it uses less digits than its factorization.
671026045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134205214.
The product of its (nonzero) digits is 10080, while the sum is 31.
The square root of 671026045 is about 25904.1704171355. The cubic root of 671026045 is about 875.4804632038.
The spelling of 671026045 in words is "six hundred seventy-one million, twenty-six thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.905 sec. • engine limits •