Base | Representation |
---|---|
bin | 10110010111101000101… |
… | …01101100000101101000 |
3 | 2201110220022002112121111 |
4 | 23023310111230011220 |
5 | 100043044444130000 |
6 | 1345031440320104 |
7 | 106346465666122 |
oct | 13136425540550 |
9 | 2643808075544 |
10 | 768603505000 |
11 | 276a65706371 |
12 | 104b63913034 |
13 | 5762c492296 |
14 | 292b467c212 |
15 | 14ed6cb6cba |
hex | b2f456c168 |
768603505000 has 80 divisors (see below), whose sum is σ = 1802787376500. Its totient is φ = 307108608000.
The previous prime is 768603504997. The next prime is 768603505013. The reversal of 768603505000 is 505306867.
It can be written as a sum of positive squares in 10 ways, for example, as 70499808324 + 698103696676 = 265518^2 + 835526^2 .
It is a Harshad number since it is a multiple of its sum of digits (40).
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 19 ways as a sum of consecutive naturals, for example, 4562266 + ... + 4727734.
Almost surely, 2768603505000 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 768603505000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (901393688250).
768603505000 is an abundant number, since it is smaller than the sum of its proper divisors (1034183871500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
768603505000 is a wasteful number, since it uses less digits than its factorization.
768603505000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166424 (or 166405 counting only the distinct ones).
The product of its (nonzero) digits is 151200, while the sum is 40.
The spelling of 768603505000 in words is "seven hundred sixty-eight billion, six hundred three million, five hundred five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •