Base | Representation |
---|---|
bin | 100111011011000… |
… | …110101001011101 |
3 | 1201002120102220221 |
4 | 213123012221131 |
5 | 2323310312131 |
6 | 145344241341 |
7 | 22250643052 |
oct | 4733065135 |
9 | 1632512827 |
10 | 661416541 |
11 | 30a397045 |
12 | 165610251 |
13 | a7050546 |
14 | 63bb3029 |
15 | 3d100411 |
hex | 276c6a5d |
661416541 has 8 divisors (see below), whose sum is σ = 671475744. Its totient is φ = 651429360.
The previous prime is 661416533. The next prime is 661416559. The reversal of 661416541 is 145614166.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 661416541 - 23 = 661416533 is a prime.
It is a super-3 number, since 3×6614165413 (a number of 27 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 661416497 and 661416506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (661416941) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 646 + ... + 36376.
It is an arithmetic number, because the mean of its divisors is an integer number (83934468).
Almost surely, 2661416541 is an apocalyptic number.
It is an amenable number.
661416541 is a deficient number, since it is larger than the sum of its proper divisors (10059203).
661416541 is a wasteful number, since it uses less digits than its factorization.
661416541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36011.
The product of its digits is 17280, while the sum is 34.
The square root of 661416541 is about 25718.0197721364. The cubic root of 661416541 is about 871.2812148465.
The spelling of 661416541 in words is "six hundred sixty-one million, four hundred sixteen thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •