Base | Representation |
---|---|
bin | 1001101101111… |
… | …11110100001011 |
3 | 12200101221200111 |
4 | 10312333310023 |
5 | 131332313102 |
6 | 12031215151 |
7 | 2006650132 |
oct | 466776413 |
9 | 180357614 |
10 | 81526027 |
11 | 42023790 |
12 | 233774b7 |
13 | 13b75b6b |
14 | ab82919 |
15 | 7255cd7 |
hex | 4dbfd0b |
81526027 has 4 divisors (see below), whose sum is σ = 88937496. Its totient is φ = 74114560.
The previous prime is 81526019. The next prime is 81526043. The reversal of 81526027 is 72062518.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 81526027 - 23 = 81526019 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
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 81526027.
It is not an unprimeable number, because it can be changed into a prime (81526427) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 3705718 + ... + 3705739.
It is an arithmetic number, because the mean of its divisors is an integer number (22234374).
Almost surely, 281526027 is an apocalyptic number.
81526027 is a deficient number, since it is larger than the sum of its proper divisors (7411469).
81526027 is a wasteful number, since it uses less digits than its factorization.
81526027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7411468.
The product of its (nonzero) digits is 6720, while the sum is 31.
The square root of 81526027 is about 9029.1764297748. The cubic root of 81526027 is about 433.6094708737.
The spelling of 81526027 in words is "eighty-one million, five hundred twenty-six thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •