Base | Representation |
---|---|
bin | 111101100111000011… |
… | …001001010011001101 |
3 | 20022202100021021010100 |
4 | 331213003021103031 |
5 | 2040440231342323 |
6 | 50220200401313 |
7 | 4531225341054 |
oct | 754703112315 |
9 | 208670237110 |
10 | 66153387213 |
11 | 26067953a41 |
12 | 109a2776239 |
13 | 631353c804 |
14 | 32b7bcd39b |
15 | 1ac2a88943 |
hex | f670c94cd |
66153387213 has 6 divisors (see below), whose sum is σ = 95554892654. Its totient is φ = 44102258136.
The previous prime is 66153387197. The next prime is 66153387227. The reversal of 66153387213 is 31278335166.
66153387213 is a `hidden beast` number, since 6 + 6 + 1 + 53 + 387 + 213 = 666.
It can be written as a sum of positive squares in only one way, i.e., 65309891364 + 843495849 = 255558^2 + 29043^2 .
It is not a de Polignac number, because 66153387213 - 24 = 66153387197 is a prime.
It is a super-2 number, since 2×661533872132 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66153383213) 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 in 5 ways as a sum of consecutive naturals, for example, 3675188170 + ... + 3675188187.
Almost surely, 266153387213 is an apocalyptic number.
It is an amenable number.
66153387213 is a deficient number, since it is larger than the sum of its proper divisors (29401505441).
66153387213 is a wasteful number, since it uses less digits than its factorization.
66153387213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7350376363 (or 7350376360 counting only the distinct ones).
The product of its digits is 544320, while the sum is 45.
The spelling of 66153387213 in words is "sixty-six billion, one hundred fifty-three million, three hundred eighty-seven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •