Base | Representation |
---|---|
bin | 111110001010000011… |
… | …101100010110010111 |
3 | 20101021021110112112102 |
4 | 332022003230112113 |
5 | 2043141111431320 |
6 | 50354341312315 |
7 | 4551616605323 |
oct | 761203542627 |
9 | 211237415472 |
10 | 66740733335 |
11 | 26339449861 |
12 | 10b2740569b |
13 | 63a81278b3 |
14 | 3331c00983 |
15 | 1b09407175 |
hex | f8a0ec597 |
66740733335 has 4 divisors (see below), whose sum is σ = 80088880008. Its totient is φ = 53392586664.
The previous prime is 66740733331. The next prime is 66740733377. The reversal of 66740733335 is 53333704766.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 53333704766 = 2 ⋅26666852383.
It is a cyclic number.
It is not a de Polignac number, because 66740733335 - 22 = 66740733331 is a prime.
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 66740733335.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66740733331) 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 3 ways as a sum of consecutive naturals, for example, 6674073329 + ... + 6674073338.
It is an arithmetic number, because the mean of its divisors is an integer number (20022220002).
Almost surely, 266740733335 is an apocalyptic number.
66740733335 is a deficient number, since it is larger than the sum of its proper divisors (13348146673).
66740733335 is a wasteful number, since it uses less digits than its factorization.
66740733335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13348146672.
The product of its (nonzero) digits is 2857680, while the sum is 47.
The spelling of 66740733335 in words is "sixty-six billion, seven hundred forty million, seven hundred thirty-three thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •