Base | Representation |
---|---|
bin | 10011011001111000100… |
… | …10011100111111110001 |
3 | 2100201221122202110202001 |
4 | 21230330102130333301 |
5 | 41410431214314301 |
6 | 1230143035454001 |
7 | 66112140255055 |
oct | 11547422347761 |
9 | 2321848673661 |
10 | 666731401201 |
11 | 237839548a48 |
12 | a9272bb7301 |
13 | 4ab45b68518 |
14 | 243acb35c65 |
15 | 1252352ec01 |
hex | 9b3c49cff1 |
666731401201 has 8 divisors (see below), whose sum is σ = 704302471520. Its totient is φ = 629408325312.
The previous prime is 666731401177. The next prime is 666731401229. The reversal of 666731401201 is 102104137666.
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 666731401201 - 211 = 666731399153 is a prime.
It is a super-2 number, since 2×6667314012012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (666731401001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61993080 + ... + 62003833.
It is an arithmetic number, because the mean of its divisors is an integer number (88037808940).
Almost surely, 2666731401201 is an apocalyptic number.
It is an amenable number.
666731401201 is a deficient number, since it is larger than the sum of its proper divisors (37571070319).
666731401201 is a wasteful number, since it uses less digits than its factorization.
666731401201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123997215.
The product of its (nonzero) digits is 36288, while the sum is 37.
Adding to 666731401201 its reverse (102104137666), we get a palindrome (768835538867).
The spelling of 666731401201 in words is "six hundred sixty-six billion, seven hundred thirty-one million, four hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •