Base | Representation |
---|---|
bin | 10010100010000001010100… |
… | …111111101001011110000000 |
3 | 101200120120210001202210211100 |
4 | 102202001110333221132000 |
5 | 41140320040144124333 |
6 | 445201500220414400 |
7 | 23111243341106154 |
oct | 2242012477513600 |
9 | 350516701683740 |
10 | 81502725379968 |
11 | 23a73125783872 |
12 | 91839359a7400 |
13 | 366289baaa399 |
14 | 161aa7817d064 |
15 | 9651161cd213 |
hex | 4a2054fe9780 |
81502725379968 has 48 divisors (see below), whose sum is σ = 234532582151400. Its totient is φ = 27167575126272.
The previous prime is 81502725379951. The next prime is 81502725380039. The reversal of 81502725379968 is 86997352720518.
81502725379968 is a `hidden beast` number, since 8 + 1 + 5 + 0 + 27 + 2 + 537 + 9 + 9 + 68 = 666.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a junction number, because it is equal to n+sod(n) for n = 81502725379896 and 81502725379905.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 35374445628 + ... + 35374447931.
Almost surely, 281502725379968 is an apocalyptic number.
It is an amenable number.
81502725379968 is an abundant number, since it is smaller than the sum of its proper divisors (153029856771432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
81502725379968 is a wasteful number, since it uses less digits than its factorization.
81502725379968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70748893579 (or 70748893564 counting only the distinct ones).
The product of its (nonzero) digits is 457228800, while the sum is 72.
The spelling of 81502725379968 in words is "eighty-one trillion, five hundred two billion, seven hundred twenty-five million, three hundred seventy-nine thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •