Base | Representation |
---|---|
bin | 11000110110100… |
… | …101111010010001 |
3 | 1002001120222102001 |
4 | 120312211322101 |
5 | 1323220323431 |
6 | 105212554001 |
7 | 13222065121 |
oct | 3066457221 |
9 | 1061528361 |
10 | 416964241 |
11 | 1a4402451 |
12 | b7782901 |
13 | 68501005 |
14 | 3d53cc81 |
15 | 26914e61 |
hex | 18da5e91 |
416964241 has 8 divisors (see below), whose sum is σ = 420798464. Its totient is φ = 413138880.
The previous prime is 416964239. The next prime is 416964283. The reversal of 416964241 is 142469614.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a 2-Lehmer number, since φ(416964241) divides (416964241-1)2.
It is a cyclic number.
It is a Carmichael number.
It is not a de Polignac number, because 416964241 - 21 = 416964239 is a prime.
It is a deceptive number, since it divides R416964240.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 416964241.
It is not an unprimeable number, because it can be changed into a prime (416964221) 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, 124201 + ... + 127513.
It is an arithmetic number, because the mean of its divisors is an integer number (52599808).
It is a Poulet number, since it divides 2416964240-1.
Almost surely, 2416964241 is an apocalyptic number.
It is an amenable number.
416964241 is a deficient number, since it is larger than the sum of its proper divisors (3834223).
416964241 is a wasteful number, since it uses less digits than its factorization.
416964241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4431.
The product of its digits is 41472, while the sum is 37.
The square root of 416964241 is about 20419.7022750088. The cubic root of 416964241 is about 747.0785555850.
The spelling of 416964241 in words is "four hundred sixteen million, nine hundred sixty-four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •