Base | Representation |
---|---|
bin | 111110001000011100… |
… | …110100111001011001 |
3 | 20101012101201112101021 |
4 | 332020130310321121 |
5 | 2043112211030023 |
6 | 50351535322441 |
7 | 4551141444631 |
oct | 761034647131 |
9 | 211171645337 |
10 | 66713767513 |
11 | 26325200a58 |
12 | 10b1a380421 |
13 | 63a26759a3 |
14 | 332c3c16c1 |
15 | 1b06d7c35d |
hex | f88734e59 |
66713767513 has 4 divisors (see below), whose sum is σ = 66724334820. Its totient is φ = 66703200208.
The previous prime is 66713767493. The next prime is 66713767529. The reversal of 66713767513 is 31576731766.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 25200927504 + 41512840009 = 158748^2 + 203747^2 .
It is a cyclic number.
It is not a de Polignac number, because 66713767513 - 25 = 66713767481 is a prime.
It is a super-2 number, since 2×667137675132 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (66713767553) 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, 5274178 + ... + 5286811.
It is an arithmetic number, because the mean of its divisors is an integer number (16681083705).
Almost surely, 266713767513 is an apocalyptic number.
It is an amenable number.
66713767513 is a deficient number, since it is larger than the sum of its proper divisors (10567307).
66713767513 is a wasteful number, since it uses less digits than its factorization.
66713767513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10567306.
The product of its digits is 3333960, while the sum is 52.
The spelling of 66713767513 in words is "sixty-six billion, seven hundred thirteen million, seven hundred sixty-seven thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •