Base | Representation |
---|---|
bin | 10110010111010110101… |
… | …01101100001100100000 |
3 | 2201110111202222020002110 |
4 | 23023223111230030200 |
5 | 100042242320313441 |
6 | 1345004444115320 |
7 | 106342653364656 |
oct | 13135325541440 |
9 | 2643452866073 |
10 | 768452510496 |
11 | 276998454a20 |
12 | 104b21235b40 |
13 | 57607105818 |
14 | 2929c5b4dd6 |
15 | 14ec88dcb16 |
hex | b2eb56c320 |
768452510496 has 96 divisors (see below), whose sum is σ = 2203940467008. Its totient is φ = 232507581440.
The previous prime is 768452510489. The next prime is 768452510533. The reversal of 768452510496 is 694015254867.
It is a tau number, because it is divible by the number of its divisors (96).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 132370 + ... + 1246766.
It is an arithmetic number, because the mean of its divisors is an integer number (22957713198).
Almost surely, 2768452510496 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 768452510496, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1101970233504).
768452510496 is an abundant number, since it is smaller than the sum of its proper divisors (1435487956512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
768452510496 is a wasteful number, since it uses less digits than its factorization.
768452510496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1115074 (or 1115066 counting only the distinct ones).
The product of its (nonzero) digits is 14515200, while the sum is 57.
The spelling of 768452510496 in words is "seven hundred sixty-eight billion, four hundred fifty-two million, five hundred ten thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •