Base | Representation |
---|---|
bin | 10011011001111000100… |
… | …10011100111111101111 |
3 | 2100201221122202110201222 |
4 | 21230330102130333233 |
5 | 41410431214314244 |
6 | 1230143035453555 |
7 | 66112140255053 |
oct | 11547422347757 |
9 | 2321848673658 |
10 | 666731401199 |
11 | 237839548a46 |
12 | a9272bb72bb |
13 | 4ab45b68516 |
14 | 243acb35c63 |
15 | 1252352ebee |
hex | 9b3c49cfef |
666731401199 has 4 divisors (see below), whose sum is σ = 666761686560. Its totient is φ = 666701115840.
The previous prime is 666731401177. The next prime is 666731401229. The reversal of 666731401199 is 991104137666.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 666731401199 - 28 = 666731400943 is a prime.
It is a super-2 number, since 2×6667314011992 (a number of 24 digits) contains 22 as substring.
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 666731401199.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (666731401129) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15109634 + ... + 15153695.
It is an arithmetic number, because the mean of its divisors is an integer number (166690421640).
Almost surely, 2666731401199 is an apocalyptic number.
666731401199 is a deficient number, since it is larger than the sum of its proper divisors (30285361).
666731401199 is a wasteful number, since it uses less digits than its factorization.
666731401199 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30285360.
The product of its (nonzero) digits is 1469664, while the sum is 53.
The spelling of 666731401199 in words is "six hundred sixty-six billion, seven hundred thirty-one million, four hundred one thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •