Base | Representation |
---|---|
bin | 10110011010010000101… |
… | …10100101101010111000 |
3 | 2201121112112100200022000 |
4 | 23031020112211222320 |
5 | 100103441313331000 |
6 | 1345423351301000 |
7 | 106426432510530 |
oct | 13151026455270 |
9 | 2647475320260 |
10 | 770013027000 |
11 | 277619309088 |
12 | 10529797a760 |
13 | 577c54c5b79 |
14 | 293a994c4c0 |
15 | 1506a8dd000 |
hex | b3485a5ab8 |
770013027000 has 256 divisors, whose sum is σ = 3050719027200. Its totient is φ = 176002934400.
The previous prime is 770013026969. The next prime is 770013027001. The reversal of 770013027000 is 720310077.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (770013027001) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 1848072 + ... + 2226071.
It is an arithmetic number, because the mean of its divisors is an integer number (11916871200).
Almost surely, 2770013027000 is an apocalyptic number.
770013027000 is a gapful number since it is divisible by the number (70) formed by its first and last digit.
It is an amenable number.
770013027000 is an abundant number, since it is smaller than the sum of its proper divisors (2280706000200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
770013027000 is a wasteful number, since it uses less digits than its factorization.
770013027000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4074180 (or 4074160 counting only the distinct ones).
The product of its (nonzero) digits is 2058, while the sum is 27.
Adding to 770013027000 its reverse (720310077), we get a palindrome (770733337077).
The spelling of 770013027000 in words is "seven hundred seventy billion, thirteen million, twenty-seven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •