Base | Representation |
---|---|
bin | 111010101011010100000… |
… | …1100000000110011110001 |
3 | 1001112221211011002211100210 |
4 | 1311112220030000303301 |
5 | 2024112021141222141 |
6 | 25052434022134333 |
7 | 1461432134221434 |
oct | 165265014006361 |
9 | 31487734084323 |
10 | 8064475335921 |
11 | 262a1410a5424 |
12 | aa2b485813a9 |
13 | 4666275a07c4 |
14 | 1dc47365b81b |
15 | deb97533916 |
hex | 755a8300cf1 |
8064475335921 has 8 divisors (see below), whose sum is σ = 11385141650784. Its totient is φ = 5060062955840.
The previous prime is 8064475335899. The next prime is 8064475335929. The reversal of 8064475335921 is 1295335744608.
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 8064475335921 - 218 = 8064475073777 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (8064475335929) 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 7 ways as a sum of consecutive naturals, for example, 79063483635 + ... + 79063483736.
It is an arithmetic number, because the mean of its divisors is an integer number (1423142706348).
It is a 1-persistent number, because it is pandigital, but 2⋅8064475335921 = 16128950671842 is not.
Almost surely, 28064475335921 is an apocalyptic number.
It is an amenable number.
8064475335921 is a deficient number, since it is larger than the sum of its proper divisors (3320666314863).
8064475335921 is a wasteful number, since it uses less digits than its factorization.
8064475335921 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158126967391.
The product of its (nonzero) digits is 21772800, while the sum is 57.
The spelling of 8064475335921 in words is "eight trillion, sixty-four billion, four hundred seventy-five million, three hundred thirty-five thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •