Base | Representation |
---|---|
bin | 10011011001011110110… |
… | …01001001000111111001 |
3 | 2100201101120122202001200 |
4 | 21230233121021013321 |
5 | 41410010323113001 |
6 | 1230105350404413 |
7 | 66103602312342 |
oct | 11545731110771 |
9 | 2321346582050 |
10 | 666515051001 |
11 | 237738408928 |
12 | a9212660709 |
13 | 4ab100a8157 |
14 | 2438c0d90c9 |
15 | 1250e546086 |
hex | 9b2f6491f9 |
666515051001 has 6 divisors (see below), whose sum is σ = 962743962570. Its totient is φ = 444343367328.
The previous prime is 666515050997. The next prime is 666515051077. The reversal of 666515051001 is 100150515666.
It can be written as a sum of positive squares in only one way, i.e., 633934440000 + 32580611001 = 796200^2 + 180501^2 .
It is not a de Polignac number, because 666515051001 - 22 = 666515050997 is a prime.
It is a super-2 number, since 2×6665150510012 (a number of 24 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (666515051401) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 37028613936 + ... + 37028613953.
It is an arithmetic number, because the mean of its divisors is an integer number (160457327095).
Almost surely, 2666515051001 is an apocalyptic number.
It is an amenable number.
666515051001 is a deficient number, since it is larger than the sum of its proper divisors (296228911569).
666515051001 is a wasteful number, since it uses less digits than its factorization.
666515051001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74057227895 (or 74057227892 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 36.
Adding to 666515051001 its reverse (100150515666), we get a palindrome (766665566667).
The spelling of 666515051001 in words is "six hundred sixty-six billion, five hundred fifteen million, fifty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •