Base | Representation |
---|---|
bin | 111110011001011111… |
… | …001011000010000101 |
3 | 20101221022120002011201 |
4 | 332121133023002011 |
5 | 2044203344021031 |
6 | 50440145502501 |
7 | 4561212106423 |
oct | 763137130205 |
9 | 211838502151 |
10 | 66999595141 |
11 | 26461585536 |
12 | 10b9a041a31 |
13 | 6419950a6b |
14 | 3358346113 |
15 | 1b21edbd61 |
hex | f997cb085 |
66999595141 has 2 divisors, whose sum is σ = 66999595142. Its totient is φ = 66999595140.
The previous prime is 66999595111. The next prime is 66999595183. The reversal of 66999595141 is 14159599966.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 42878399041 + 24121196100 = 207071^2 + 155310^2 .
It is a cyclic number.
It is not a de Polignac number, because 66999595141 - 211 = 66999593093 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (66999595111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 33499797570 + 33499797571.
It is an arithmetic number, because the mean of its divisors is an integer number (33499797571).
Almost surely, 266999595141 is an apocalyptic number.
It is an amenable number.
66999595141 is a deficient number, since it is larger than the sum of its proper divisors (1).
66999595141 is an equidigital number, since it uses as much as digits as its factorization.
66999595141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 23619600, while the sum is 64.
The spelling of 66999595141 in words is "sixty-six billion, nine hundred ninety-nine million, five hundred ninety-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •