Base | Representation |
---|---|
bin | 100101101111111001… |
… | …1001100010100000000 |
3 | 21202020111111111202000 |
4 | 1023133303030110000 |
5 | 2312004410302042 |
6 | 101123530024000 |
7 | 5566562623350 |
oct | 1133763142400 |
9 | 252214444660 |
10 | 81064150272 |
11 | 31419665a16 |
12 | 13864278000 |
13 | 784b743031 |
14 | 3cd0224b60 |
15 | 2196b2274c |
hex | 12dfccc500 |
81064150272 has 288 divisors, whose sum is σ = 275418044160. Its totient is φ = 23038525440.
The previous prime is 81064150241. The next prime is 81064150289. The reversal of 81064150272 is 27205146018.
81064150272 is a `hidden beast` number, since 8 + 1 + 0 + 641 + 5 + 0 + 2 + 7 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (288).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 9333772 + ... + 9342452.
Almost surely, 281064150272 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 81064150272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (137709022080).
81064150272 is an abundant number, since it is smaller than the sum of its proper divisors (194353893888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
81064150272 is a wasteful number, since it uses less digits than its factorization.
81064150272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8906 (or 8886 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 36.
The spelling of 81064150272 in words is "eighty-one billion, sixty-four million, one hundred fifty thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •