Base | Representation |
---|---|
bin | 100011110000110111… |
… | …0011101010000110000 |
3 | 21100020102120020112000 |
4 | 1013201232131100300 |
5 | 2224242140333422 |
6 | 55140534334000 |
7 | 5356132642245 |
oct | 1074156352060 |
9 | 240212506460 |
10 | 76801496112 |
11 | 2a631495840 |
12 | 12a747ba300 |
13 | 731c59b273 |
14 | 3a0805d5cc |
15 | 1ee77b8cac |
hex | 11e1b9d430 |
76801496112 has 80 divisors (see below), whose sum is σ = 240489548160. Its totient is φ = 23273179200.
The previous prime is 76801496089. The next prime is 76801496119. The reversal of 76801496112 is 21169410867.
76801496112 is a `hidden beast` number, since 76 + 80 + 1 + 496 + 1 + 12 = 666.
It is a super-2 number, since 2×768014961122 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (76801496119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8076214 + ... + 8085717.
It is an arithmetic number, because the mean of its divisors is an integer number (3006119352).
Almost surely, 276801496112 is an apocalyptic number.
76801496112 is a gapful number since it is divisible by the number (72) formed by its first and last digit.
It is an amenable number.
76801496112 is an abundant number, since it is smaller than the sum of its proper divisors (163688052048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76801496112 is a wasteful number, since it uses less digits than its factorization.
76801496112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16161959 (or 16161947 counting only the distinct ones).
The product of its (nonzero) digits is 145152, while the sum is 45.
The spelling of 76801496112 in words is "seventy-six billion, eight hundred one million, four hundred ninety-six thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •