Base | Representation |
---|---|
bin | 110001110110010… |
… | …1011000011000001 |
3 | 11022120101200100201 |
4 | 1203230223003001 |
5 | 11411144430131 |
6 | 433550445201 |
7 | 56310222211 |
oct | 14354530301 |
9 | 4276350321 |
10 | 1672655041 |
11 | 789196542 |
12 | 3a8203801 |
13 | 2086c3c15 |
14 | 11c208241 |
15 | 9bca1761 |
hex | 63b2b0c1 |
1672655041 has 32 divisors (see below), whose sum is σ = 1861131168. Its totient is φ = 1496678400.
The previous prime is 1672655027. The next prime is 1672655051. The reversal of 1672655041 is 1405562761.
It is a happy number.
It can be written as a sum of positive squares in 16 ways, for example, as 72335025 + 1600320016 = 8505^2 + 40004^2 .
It is a 3-Lehmer number, since φ(1672655041) divides (1672655041-1)3.
It is a cyclic number.
It is not a de Polignac number, because 1672655041 - 25 = 1672655009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a deceptive number, since it divides R1672655040.
It is not an unprimeable number, because it can be changed into a prime (1672655051) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7178661 + ... + 7178893.
It is an arithmetic number, because the mean of its divisors is an integer number (58160349).
Almost surely, 21672655041 is an apocalyptic number.
It is an amenable number.
1672655041 is a deficient number, since it is larger than the sum of its proper divisors (188476127).
1672655041 is a wasteful number, since it uses less digits than its factorization.
1672655041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 501.
The product of its (nonzero) digits is 50400, while the sum is 37.
The square root of 1672655041 is about 40898.1055918242. The cubic root of 1672655041 is about 1187.0494047558.
The spelling of 1672655041 in words is "one billion, six hundred seventy-two million, six hundred fifty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •