Base | Representation |
---|---|
bin | 111101010111110110… |
… | …001010110000000001 |
3 | 20022002120022212100022 |
4 | 331113312022300001 |
5 | 2034424432431131 |
6 | 50135005503225 |
7 | 4522010352311 |
oct | 752766126001 |
9 | 208076285308 |
10 | 65898327041 |
11 | 25a46984508 |
12 | 10931271b15 |
13 | 62a2747b31 |
14 | 3291d97441 |
15 | 1aaa4a537b |
hex | f57d8ac01 |
65898327041 has 8 divisors (see below), whose sum is σ = 65984684544. Its totient is φ = 65812007520.
The previous prime is 65898327031. The next prime is 65898327059. The reversal of 65898327041 is 14072389856.
65898327041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 65898327041 - 214 = 65898310657 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (65898327031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5260976 + ... + 5273486.
It is an arithmetic number, because the mean of its divisors is an integer number (8248085568).
It is a 2-persistent number, because it is pandigital, and so is 2⋅65898327041 = 131796654082, but 3⋅65898327041 = 197694981123 is not.
Almost surely, 265898327041 is an apocalyptic number.
65898327041 is the 137216-th centered heptagonal number.
It is an amenable number.
65898327041 is a deficient number, since it is larger than the sum of its proper divisors (86357503).
65898327041 is a wasteful number, since it uses less digits than its factorization.
65898327041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18991.
The product of its (nonzero) digits is 2903040, while the sum is 53.
The spelling of 65898327041 in words is "sixty-five billion, eight hundred ninety-eight million, three hundred twenty-seven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •