Base | Representation |
---|---|
bin | 1001101101110… |
… | …01000000100001 |
3 | 12200100112102211 |
4 | 10312321000201 |
5 | 131330420040 |
6 | 12030442121 |
7 | 2006502631 |
oct | 466710041 |
9 | 180315384 |
10 | 81498145 |
11 | 42004843 |
12 | 23363341 |
13 | 13b66271 |
14 | ab766c1 |
15 | 724c8ea |
hex | 4db9021 |
81498145 has 8 divisors (see below), whose sum is σ = 98046504. Its totient is φ = 65032704.
The previous prime is 81498133. The next prime is 81498167. The reversal of 81498145 is 54189418.
It can be written as a sum of positive squares in 4 ways, for example, as 2430481 + 79067664 = 1559^2 + 8892^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 81498145 - 211 = 81496097 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 81498098 and 81498107.
It is an unprimeable number.
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, 18544 + ... + 22513.
It is an arithmetic number, because the mean of its divisors is an integer number (12255813).
Almost surely, 281498145 is an apocalyptic number.
81498145 is the 6384-th centered square number.
It is an amenable number.
81498145 is a deficient number, since it is larger than the sum of its proper divisors (16548359).
81498145 is a wasteful number, since it uses less digits than its factorization.
81498145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41459.
The product of its digits is 46080, while the sum is 40.
The square root of 81498145 is about 9027.6323031014. The cubic root of 81498145 is about 433.5600335826.
The spelling of 81498145 in words is "eighty-one million, four hundred ninety-eight thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •