Base | Representation |
---|---|
bin | 1001101101111… |
… | …00111110000000 |
3 | 12200101100200200 |
4 | 10312330332000 |
5 | 131331424433 |
6 | 12031045200 |
7 | 2006601135 |
oct | 466747600 |
9 | 180340620 |
10 | 81514368 |
11 | 42015a51 |
12 | 23370800 |
13 | 13b70770 |
14 | ab7c58c |
15 | 7252613 |
hex | 4dbcf80 |
81514368 has 96 divisors (see below), whose sum is σ = 252656040. Its totient is φ = 25076736.
The previous prime is 81514343. The next prime is 81514379. The reversal of 81514368 is 86341518.
81514368 is a `hidden beast` number, since 81 + 514 + 3 + 68 = 666.
It is a tau number, because it is divible by the number of its divisors (96).
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 polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12255 + ... + 17697.
Almost surely, 281514368 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 81514368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126328020).
81514368 is an abundant number, since it is smaller than the sum of its proper divisors (171141672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
81514368 is a wasteful number, since it uses less digits than its factorization.
With its predecessor (81514367) it forms a Ruth-Aaron pair, since the sum of their distinct prime factors is the same (5461).
81514368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5476 (or 5461 counting only the distinct ones).
The product of its digits is 23040, while the sum is 36.
The square root of 81514368 is about 9028.5307774853. The cubic root of 81514368 is about 433.5887997906.
The spelling of 81514368 in words is "eighty-one million, five hundred fourteen thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •