Base | Representation |
---|---|
bin | 1001100011010… |
… | …11111110001111 |
3 | 12120210020020002 |
4 | 10301223332033 |
5 | 131003242111 |
6 | 11541314515 |
7 | 1662061625 |
oct | 461537617 |
9 | 176706202 |
10 | 80134031 |
11 | 4126297a |
12 | 22a05a3b |
13 | 137a93b3 |
14 | a8dd515 |
15 | 707d63b |
hex | 4c6bf8f |
80134031 has 2 divisors, whose sum is σ = 80134032. Its totient is φ = 80134030.
The previous prime is 80134027. The next prime is 80134051. The reversal of 80134031 is 13043108.
It is a happy number.
It is an a-pointer prime, because the next prime (80134051) can be obtained adding 80134031 to its sum of digits (20).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 80134031 - 22 = 80134027 is a prime.
It is a super-2 number, since 2×801340312 = 12842925848617922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 80133994 and 80134012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (80134051) 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 as a sum of consecutive naturals, namely, 40067015 + 40067016.
It is an arithmetic number, because the mean of its divisors is an integer number (40067016).
Almost surely, 280134031 is an apocalyptic number.
80134031 is a deficient number, since it is larger than the sum of its proper divisors (1).
80134031 is an equidigital number, since it uses as much as digits as its factorization.
80134031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
The square root of 80134031 is about 8951.7613350670. The cubic root of 80134031 is about 431.1274379428.
Adding to 80134031 its reverse (13043108), we get a palindrome (93177139).
The spelling of 80134031 in words is "eighty million, one hundred thirty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •