Base | Representation |
---|---|
bin | 1001101011001… |
… | …00000110000101 |
3 | 12122200212100012 |
4 | 10311210012011 |
5 | 131233302331 |
6 | 12015200005 |
7 | 2003523626 |
oct | 465440605 |
9 | 178625305 |
10 | 81150341 |
11 | 418974a8 |
12 | 23216005 |
13 | 13a73b6c |
14 | aac5a4d |
15 | 71ce82b |
hex | 4d64185 |
81150341 has 4 divisors (see below), whose sum is σ = 82876992. Its totient is φ = 79423692.
The previous prime is 81150337. The next prime is 81150347. The reversal of 81150341 is 14305118.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 14305118 = 2 ⋅7152559.
It is a cyclic number.
It is not a de Polignac number, because 81150341 - 22 = 81150337 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (81150347) 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 3 ways as a sum of consecutive naturals, for example, 863255 + ... + 863348.
It is an arithmetic number, because the mean of its divisors is an integer number (20719248).
Almost surely, 281150341 is an apocalyptic number.
It is an amenable number.
81150341 is a deficient number, since it is larger than the sum of its proper divisors (1726651).
81150341 is a wasteful number, since it uses less digits than its factorization.
81150341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1726650.
The product of its (nonzero) digits is 480, while the sum is 23.
The square root of 81150341 is about 9008.3484057845. The cubic root of 81150341 is about 432.9423960692.
Adding to 81150341 its reverse (14305118), we get a palindrome (95455459).
The spelling of 81150341 in words is "eighty-one million, one hundred fifty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •