Base | Representation |
---|---|
bin | 11110010100110111000000… |
… | …11010010010111000000101 |
3 | 22202010020220110112102121100 |
4 | 33022123200122102320011 |
5 | 32220101322332232031 |
6 | 353455440420410313 |
7 | 20022002420446650 |
oct | 1712334032227005 |
9 | 282106813472540 |
10 | 66687427227141 |
11 | 1a280a8514a886 |
12 | 7590578546999 |
13 | 2b2979c65b946 |
14 | 126798db12897 |
15 | 7a9a5de31de6 |
hex | 3ca6e0692e05 |
66687427227141 has 24 divisors (see below), whose sum is σ = 110214744906240. Its totient is φ = 38062944693216.
The previous prime is 66687427227139. The next prime is 66687427227143. The reversal of 66687427227141 is 14172272478666.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (66687427227139) and next prime (66687427227143).
It is not a de Polignac number, because 66687427227141 - 21 = 66687427227139 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66687427227143) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 613231026 + ... + 613339763.
It is an arithmetic number, because the mean of its divisors is an integer number (4592281037760).
Almost surely, 266687427227141 is an apocalyptic number.
It is an amenable number.
66687427227141 is a deficient number, since it is larger than the sum of its proper divisors (43527317679099).
66687427227141 is a wasteful number, since it uses less digits than its factorization.
66687427227141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1226571665 (or 1226571662 counting only the distinct ones).
The product of its digits is 75866112, while the sum is 63.
The spelling of 66687427227141 in words is "sixty-six trillion, six hundred eighty-seven billion, four hundred twenty-seven million, two hundred twenty-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •