Base | Representation |
---|---|
bin | 10110010111110111001… |
… | …11110101010101011100 |
3 | 2201111012211000210100120 |
4 | 23023323213311111130 |
5 | 100043322234430410 |
6 | 1345051523354540 |
7 | 106352511440415 |
oct | 13137347652534 |
9 | 2644184023316 |
10 | 768725701980 |
11 | 277018688805 |
12 | 104b98822a50 |
13 | 5764b8a81a2 |
14 | 292c69aa80c |
15 | 14ee28a3570 |
hex | b2fb9f555c |
768725701980 has 192 divisors, whose sum is σ = 2319578311680. Its totient is φ = 189519998976.
The previous prime is 768725701967. The next prime is 768725701981. The reversal of 768725701980 is 89107527867.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (768725701981) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 24518394 + ... + 24549726.
It is an arithmetic number, because the mean of its divisors is an integer number (12081137040).
Almost surely, 2768725701980 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 768725701980, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1159789155840).
768725701980 is an abundant number, since it is smaller than the sum of its proper divisors (1550852609700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
768725701980 is a wasteful number, since it uses less digits than its factorization.
768725701980 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31788 (or 31786 counting only the distinct ones).
The product of its (nonzero) digits is 11854080, while the sum is 60.
The spelling of 768725701980 in words is "seven hundred sixty-eight billion, seven hundred twenty-five million, seven hundred one thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •