Base | Representation |
---|---|
bin | 10110011100000101000… |
… | …01010000001000000000 |
3 | 2201201001112122012120110 |
4 | 23032002201100020000 |
5 | 100112441124311424 |
6 | 1350104251511320 |
7 | 106462552346040 |
oct | 13160241201000 |
9 | 2651045565513 |
10 | 770988900864 |
11 | 277a7a153606 |
12 | 10550a758540 |
13 | 5791c736820 |
14 | 2945d3b9720 |
15 | 150c6405c29 |
hex | b382850200 |
770988900864 has 320 divisors, whose sum is σ = 2541277347840. Its totient is φ = 202266132480.
The previous prime is 770988900841. The next prime is 770988900919. The reversal of 770988900864 is 468009889077.
It is a junction number, because it is equal to n+sod(n) for n = 770988900795 and 770988900804.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 26682777 + ... + 26711655.
It is an arithmetic number, because the mean of its divisors is an integer number (7941491712).
Almost surely, 2770988900864 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 770988900864, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1270638673920).
770988900864 is an abundant number, since it is smaller than the sum of its proper divisors (1770288446976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
770988900864 is a wasteful number, since it uses less digits than its factorization.
770988900864 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29111 (or 29095 counting only the distinct ones).
The product of its (nonzero) digits is 48771072, while the sum is 66.
The spelling of 770988900864 in words is "seven hundred seventy billion, nine hundred eighty-eight million, nine hundred thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •