Base | Representation |
---|---|
bin | 1001101011100… |
… | …01000010001001 |
3 | 12122210120001000 |
4 | 10311301002021 |
5 | 131242001322 |
6 | 12020245213 |
7 | 2004134265 |
oct | 465610211 |
9 | 178716030 |
10 | 81203337 |
11 | 419232a6 |
12 | 23240809 |
13 | 13a92017 |
14 | aadb0a5 |
15 | 71e03ac |
hex | 4d71089 |
81203337 has 8 divisors (see below), whose sum is σ = 120301280. Its totient is φ = 54135540.
The previous prime is 81203323. The next prime is 81203347. The reversal of 81203337 is 73330218.
It is not a de Polignac number, because 81203337 - 26 = 81203273 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 3007531 = 81203337 / (8 + 1 + 2 + 0 + 3 + 3 + 3 + 7).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 81203337.
It is not an unprimeable number, because it can be changed into a prime (81203347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1503739 + ... + 1503792.
It is an arithmetic number, because the mean of its divisors is an integer number (15037660).
Almost surely, 281203337 is an apocalyptic number.
It is an amenable number.
81203337 is a deficient number, since it is larger than the sum of its proper divisors (39097943).
81203337 is a wasteful number, since it uses less digits than its factorization.
81203337 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3007540 (or 3007534 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 27.
The square root of 81203337 is about 9011.2894193894. The cubic root of 81203337 is about 433.0366212735.
The spelling of 81203337 in words is "eighty-one million, two hundred three thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.285 sec. • engine limits •