Base | Representation |
---|---|
bin | 1001101111010… |
… | …11000110000000 |
3 | 12200201221212000 |
4 | 10313223012000 |
5 | 131404001141 |
6 | 12035104000 |
7 | 2011316013 |
oct | 467530600 |
9 | 180657760 |
10 | 81703296 |
11 | 42134994 |
12 | 23442000 |
13 | 13c0875c |
14 | abcb37a |
15 | 728d5b6 |
hex | 4deb180 |
81703296 has 128 divisors (see below), whose sum is σ = 246758400. Its totient is φ = 26601984.
The previous prime is 81703277. The next prime is 81703313. The reversal of 81703296 is 69230718.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 81703296.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 162181 + ... + 162683.
It is an arithmetic number, because the mean of its divisors is an integer number (1927800).
Almost surely, 281703296 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 81703296, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (123379200).
81703296 is an abundant number, since it is smaller than the sum of its proper divisors (165055104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
81703296 is a wasteful number, since it uses less digits than its factorization.
81703296 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 573 (or 555 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 36.
The square root of 81703296 is about 9038.9875539244. The cubic root of 81703296 is about 433.9235213905.
The spelling of 81703296 in words is "eighty-one million, seven hundred three thousand, two hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •