Base | Representation |
---|---|
bin | 11111010001100000010000… |
… | …11001001011101001011111 |
3 | 100000111110101012000201002210 |
4 | 33220300020121023221133 |
5 | 33003221312213200331 |
6 | 402133011120451503 |
7 | 20325360245613012 |
oct | 1750601031135137 |
9 | 300443335021083 |
10 | 68771157162591 |
11 | 1aa047583a3424 |
12 | 7868389479b93 |
13 | 2c4b127a00200 |
14 | 12da782871379 |
15 | 7e3d67aa9446 |
hex | 3e8c0864ba5f |
68771157162591 has 48 divisors (see below), whose sum is σ = 103610882564352. Its totient is φ = 40479514732800.
The previous prime is 68771157162571. The next prime is 68771157162593. The reversal of 68771157162591 is 19526175117786.
68771157162591 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 68771157162591 - 25 = 68771157162559 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68771157162593) 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 47 ways as a sum of consecutive naturals, for example, 566792211 + ... + 566913531.
It is an arithmetic number, because the mean of its divisors is an integer number (2158560053424).
Almost surely, 268771157162591 is an apocalyptic number.
68771157162591 is a deficient number, since it is larger than the sum of its proper divisors (34839725401761).
68771157162591 is a wasteful number, since it uses less digits than its factorization.
68771157162591 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169984 (or 169971 counting only the distinct ones).
The product of its digits is 44452800, while the sum is 66.
The spelling of 68771157162591 in words is "sixty-eight trillion, seven hundred seventy-one billion, one hundred fifty-seven million, one hundred sixty-two thousand, five hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •