Base | Representation |
---|---|
bin | 111101011110101011… |
… | …111000010100111101 |
3 | 20022101120020102222201 |
4 | 331132223320110331 |
5 | 2040143321230103 |
6 | 50154225111501 |
7 | 4524602561635 |
oct | 753653702475 |
9 | 208346212881 |
10 | 66013070653 |
11 | 25aa5726042 |
12 | 10963788591 |
13 | 62c045136a |
14 | 32a33056c5 |
15 | 1ab55bd51d |
hex | f5eaf853d |
66013070653 has 4 divisors (see below), whose sum is σ = 66021588540. Its totient is φ = 66004552768.
The previous prime is 66013070633. The next prime is 66013070657. The reversal of 66013070653 is 35607031066.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 35607031066 = 2 ⋅17803515533.
It can be written as a sum of positive squares in 2 ways, for example, as 38660210884 + 27352859769 = 196622^2 + 165387^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-66013070653 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66013070657) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4247308 + ... + 4262821.
It is an arithmetic number, because the mean of its divisors is an integer number (16505397135).
Almost surely, 266013070653 is an apocalyptic number.
It is an amenable number.
66013070653 is a deficient number, since it is larger than the sum of its proper divisors (8517887).
66013070653 is an equidigital number, since it uses as much as digits as its factorization.
66013070653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8517886.
The product of its (nonzero) digits is 68040, while the sum is 37.
The spelling of 66013070653 in words is "sixty-six billion, thirteen million, seventy thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •