Base | Representation |
---|---|
bin | 10001011011010010111110… |
… | …101000101101010000000000 |
3 | 101001100221221012120222200000 |
4 | 101123102332220231100000 |
5 | 40021203013230200333 |
6 | 431001042202400000 |
7 | 22100146642421001 |
oct | 2133227650552000 |
9 | 331327835528600 |
10 | 76642594771968 |
11 | 22469a3a753755 |
12 | 8719a21b00000 |
13 | 339c49a508984 |
14 | 14cd7429471a8 |
15 | 8cd9b2ece713 |
hex | 45b4bea2d400 |
76642594771968 has 1056 divisors, whose sum is σ = 252708206499840. Its totient is φ = 23093241937920.
The previous prime is 76642594771859. The next prime is 76642594771973. The reversal of 76642594771968 is 86917749524667.
76642594771968 is a `hidden beast` number, since 7 + 6 + 6 + 4 + 2 + 59 + 477 + 1 + 96 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (81).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 68614676946 + ... + 68614678062.
Almost surely, 276642594771968 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 76642594771968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126354103249920).
76642594771968 is an abundant number, since it is smaller than the sum of its proper divisors (176065611727872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76642594771968 is a wasteful number, since it uses less digits than its factorization.
76642594771968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1825 (or 1795 counting only the distinct ones).
The product of its digits is 7681443840, while the sum is 81.
The spelling of 76642594771968 in words is "seventy-six trillion, six hundred forty-two billion, five hundred ninety-four million, seven hundred seventy-one thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •