Base | Representation |
---|---|
bin | 1001101101000… |
… | …10000011111001 |
3 | 12200011202111122 |
4 | 10312202003321 |
5 | 131314413103 |
6 | 12024435025 |
7 | 2005631615 |
oct | 466420371 |
9 | 180152448 |
10 | 81404153 |
11 | 41a50166 |
12 | 23318a75 |
13 | 13b3254c |
14 | ab50345 |
15 | 722eb38 |
hex | 4da20f9 |
81404153 has 4 divisors (see below), whose sum is σ = 84943488. Its totient is φ = 77864820.
The previous prime is 81404123. The next prime is 81404161. The reversal of 81404153 is 35140418.
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.
It is a cyclic number.
It is not a de Polignac number, because 81404153 - 210 = 81403129 is a prime.
It is a super-2 number, since 2×814041532 = 13253272251294818, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (81404123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1769633 + ... + 1769678.
It is an arithmetic number, because the mean of its divisors is an integer number (21235872).
Almost surely, 281404153 is an apocalyptic number.
It is an amenable number.
81404153 is a deficient number, since it is larger than the sum of its proper divisors (3539335).
81404153 is a wasteful number, since it uses less digits than its factorization.
81404153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3539334.
The product of its (nonzero) digits is 1920, while the sum is 26.
The square root of 81404153 is about 9022.4250066155. The cubic root of 81404153 is about 433.3932942011.
It can be divided in two parts, 8140415 and 3, that added together give a palindrome (8140418).
The spelling of 81404153 in words is "eighty-one million, four hundred four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •