Base | Representation |
---|---|
bin | 11101101011000… |
… | …111011111011101 |
3 | 1021200210000000211 |
4 | 131223013133131 |
5 | 2004421422031 |
6 | 121222252421 |
7 | 15223405546 |
oct | 3553073735 |
9 | 1250700024 |
10 | 497842141 |
11 | 236023195 |
12 | 11a887111 |
13 | 7c1aab64 |
14 | 4a1934cd |
15 | 2da8dbb1 |
hex | 1dac77dd |
497842141 has 8 divisors (see below), whose sum is σ = 511991480. Its totient is φ = 483729408.
The previous prime is 497842069. The next prime is 497842151. The reversal of 497842141 is 141248794.
It can be written as a sum of positive squares in 4 ways, for example, as 19545241 + 478296900 = 4421^2 + 21870^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a 10-Lehmer number, since φ(497842141) divides (497842141-1)10.
It is a cyclic number.
It is not a de Polignac number, because 497842141 - 217 = 497711069 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 497842094 and 497842103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (497842151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19705 + ... + 37201.
It is an arithmetic number, because the mean of its divisors is an integer number (63998935).
Almost surely, 2497842141 is an apocalyptic number.
It is an amenable number.
497842141 is a deficient number, since it is larger than the sum of its proper divisors (14149339).
497842141 is a wasteful number, since it uses less digits than its factorization.
497842141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18303.
The product of its digits is 64512, while the sum is 40.
The square root of 497842141 is about 22312.3764086213. The cubic root of 497842141 is about 792.5570835960.
The spelling of 497842141 in words is "four hundred ninety-seven million, eight hundred forty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •