Base | Representation |
---|---|
bin | 10001011101001101011100… |
… | …110101110010011110000000 |
3 | 101001211112100220011011020011 |
4 | 101131031130311302132000 |
5 | 40030331323043121344 |
6 | 431141311141354304 |
7 | 22112513501532223 |
oct | 2135153465623600 |
9 | 331745326134204 |
10 | 76774098020224 |
11 | 2250a791921510 |
12 | 873b402108994 |
13 | 33ab9c696c0c7 |
14 | 14d5c5991d5ba |
15 | 8d210ccced34 |
hex | 45d35cd72780 |
76774098020224 has 256 divisors, whose sum is σ = 172870435584000. Its totient is φ = 33647262105600.
The previous prime is 76774098020107. The next prime is 76774098020281. The reversal of 76774098020224 is 42202089047767.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16234740292 + ... + 16234745020.
It is an arithmetic number, because the mean of its divisors is an integer number (675275139000).
Almost surely, 276774098020224 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 76774098020224, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (86435217792000).
76774098020224 is an abundant number, since it is smaller than the sum of its proper divisors (96096337563776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76774098020224 is a wasteful number, since it uses less digits than its factorization.
76774098020224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6077 (or 6065 counting only the distinct ones).
The product of its (nonzero) digits is 18966528, while the sum is 58.
The spelling of 76774098020224 in words is "seventy-six trillion, seven hundred seventy-four billion, ninety-eight million, twenty thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •