Base | Representation |
---|---|
bin | 11110010001111101101110… |
… | …01010011001111101101001 |
3 | 22201202202010210100212120221 |
4 | 33020332313022121331221 |
5 | 32211434110420320301 |
6 | 353342025442450041 |
7 | 20011551333153004 |
oct | 1710766712317551 |
9 | 281682123325527 |
10 | 66587950948201 |
11 | 1a242878403101 |
12 | 7575236063921 |
13 | 2b202a84bb327 |
14 | 1262c3446053b |
15 | 7a718ab98da1 |
hex | 3c8fb7299f69 |
66587950948201 has 4 divisors (see below), whose sum is σ = 66589253300304. Its totient is φ = 66586648596100.
The previous prime is 66587950948159. The next prime is 66587950948217. The reversal of 66587950948201 is 10284905978566.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-66587950948201 is a prime.
It is a super-2 number, since 2×665879509482012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (66587950928201) 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, 651099355 + ... + 651201616.
It is an arithmetic number, because the mean of its divisors is an integer number (16647313325076).
Almost surely, 266587950948201 is an apocalyptic number.
It is an amenable number.
66587950948201 is a deficient number, since it is larger than the sum of its proper divisors (1302352103).
66587950948201 is a wasteful number, since it uses less digits than its factorization.
66587950948201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1302352102.
The product of its (nonzero) digits is 261273600, while the sum is 70.
The spelling of 66587950948201 in words is "sixty-six trillion, five hundred eighty-seven billion, nine hundred fifty million, nine hundred forty-eight thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •