Base | Representation |
---|---|
bin | 10011010000000010001… |
… | …10000000010100111001 |
3 | 2100020022010021212012121 |
4 | 21220001012000110321 |
5 | 41314113442040001 |
6 | 1223510213441241 |
7 | 65534116261120 |
oct | 11500106002471 |
9 | 2306263255177 |
10 | 661443315001 |
11 | 235575564577 |
12 | a8238040221 |
13 | 4a4b2420831 |
14 | 2402a6c2ab7 |
15 | 1231416e6a1 |
hex | 9a01180539 |
661443315001 has 8 divisors (see below), whose sum is σ = 756360631040. Its totient is φ = 566632352448.
The previous prime is 661443314941. The next prime is 661443315047. The reversal of 661443315001 is 100513344166.
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 661443315001 - 215 = 661443282233 is a prime.
It is a super-2 number, since 2×6614433150012 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (661443315101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26575041 + ... + 26599918.
It is an arithmetic number, because the mean of its divisors is an integer number (94545078880).
Almost surely, 2661443315001 is an apocalyptic number.
It is an amenable number.
661443315001 is a deficient number, since it is larger than the sum of its proper divisors (94917316039).
661443315001 is a wasteful number, since it uses less digits than its factorization.
661443315001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53176743.
The product of its (nonzero) digits is 25920, while the sum is 34.
Adding to 661443315001 its reverse (100513344166), we get a palindrome (761956659167).
The spelling of 661443315001 in words is "six hundred sixty-one billion, four hundred forty-three million, three hundred fifteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •