Base | Representation |
---|---|
bin | 11101010001011… |
… | …101001000110101 |
3 | 1021020010020012201 |
4 | 131101131020311 |
5 | 2001211140221 |
6 | 120422144501 |
7 | 15112260223 |
oct | 3521351065 |
9 | 1236106181 |
10 | 491115061 |
11 | 232249018 |
12 | 118582131 |
13 | 7a993c38 |
14 | 49321b13 |
15 | 2d1b0891 |
hex | 1d45d235 |
491115061 has 4 divisors (see below), whose sum is σ = 491248800. Its totient is φ = 490981324.
The previous prime is 491115049. The next prime is 491115071. The reversal of 491115061 is 160511194.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 160511194 = 2 ⋅80255597.
It is a cyclic number.
It is not a de Polignac number, because 491115061 - 217 = 490983989 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (491115011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 61201 + ... + 68758.
It is an arithmetic number, because the mean of its divisors is an integer number (122812200).
Almost surely, 2491115061 is an apocalyptic number.
It is an amenable number.
491115061 is a deficient number, since it is larger than the sum of its proper divisors (133739).
491115061 is a wasteful number, since it uses less digits than its factorization.
491115061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133738.
The product of its (nonzero) digits is 1080, while the sum is 28.
The square root of 491115061 is about 22161.1159691925. The cubic root of 491115061 is about 788.9710799691.
The spelling of 491115061 in words is "four hundred ninety-one million, one hundred fifteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •