Base | Representation |
---|---|
bin | 110001110101111… |
… | …0111111000000001 |
3 | 11022120000000211202 |
4 | 1203223313320001 |
5 | 11411121223231 |
6 | 433542150545 |
7 | 56305360142 |
oct | 14353677001 |
9 | 4276000752 |
10 | 1672445441 |
11 | 789063017 |
12 | 3a8122455 |
13 | 20864c6b4 |
14 | 11c191ac9 |
15 | 9bc5e5cb |
hex | 63af7e01 |
1672445441 has 2 divisors, whose sum is σ = 1672445442. Its totient is φ = 1672445440.
The previous prime is 1672445419. The next prime is 1672445471. The reversal of 1672445441 is 1445442761.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1406625025 + 265820416 = 37505^2 + 16304^2 .
It is a cyclic number.
It is not a de Polignac number, because 1672445441 - 230 = 598703617 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1672445395 and 1672445404.
It is not a weakly prime, because it can be changed into another prime (1672445471) 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 as a sum of consecutive naturals, namely, 836222720 + 836222721.
It is an arithmetic number, because the mean of its divisors is an integer number (836222721).
Almost surely, 21672445441 is an apocalyptic number.
It is an amenable number.
1672445441 is a deficient number, since it is larger than the sum of its proper divisors (1).
1672445441 is an equidigital number, since it uses as much as digits as its factorization.
1672445441 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 107520, while the sum is 38.
The square root of 1672445441 is about 40895.5430456670. The cubic root of 1672445441 is about 1186.9998197263. Note that the first 3 decimals are identical.
The spelling of 1672445441 in words is "one billion, six hundred seventy-two million, four hundred forty-five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •