Base | Representation |
---|---|
bin | 101100011100111… |
… | …0111011001101101 |
3 | 10211221122022100100 |
4 | 1120321313121231 |
5 | 11023320023031 |
6 | 404001221313 |
7 | 51651041334 |
oct | 13071673155 |
9 | 3757568310 |
10 | 1491564141 |
11 | 6a5a49241 |
12 | 357631839 |
13 | 1aa02a642 |
14 | 102148d1b |
15 | 8ae2ede6 |
hex | 58e7766d |
1491564141 has 6 divisors (see below), whose sum is σ = 2154481550. Its totient is φ = 994376088.
The previous prime is 1491564077. The next prime is 1491564149. The reversal of 1491564141 is 1414651941.
1491564141 is a `hidden beast` number, since 1 + 4 + 9 + 1 + 5 + 641 + 4 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 1026946116 + 464618025 = 32046^2 + 21555^2 .
It is not a de Polignac number, because 1491564141 - 26 = 1491564077 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1491564096 and 1491564105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1491564149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 82864666 + ... + 82864683.
Almost surely, 21491564141 is an apocalyptic number.
It is an amenable number.
1491564141 is a deficient number, since it is larger than the sum of its proper divisors (662917409).
1491564141 is a wasteful number, since it uses less digits than its factorization.
1491564141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165729355 (or 165729352 counting only the distinct ones).
The product of its digits is 17280, while the sum is 36.
The square root of 1491564141 is about 38620.7734386560. The cubic root of 1491564141 is about 1142.5642853507.
The spelling of 1491564141 in words is "one billion, four hundred ninety-one million, five hundred sixty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •