Base | Representation |
---|---|
bin | 1000101111010… |
… | …11000010110001 |
3 | 12002221202120011 |
4 | 10113223002301 |
5 | 122232030411 |
6 | 11135214521 |
7 | 1550106562 |
oct | 427530261 |
9 | 162852504 |
10 | 73314481 |
11 | 38425289 |
12 | 20677441 |
13 | 1225c366 |
14 | 9a46169 |
15 | 6682c21 |
hex | 45eb0b1 |
73314481 has 4 divisors (see below), whose sum is σ = 74197872. Its totient is φ = 72431092.
The previous prime is 73314467. The next prime is 73314509. The reversal of 73314481 is 18441337.
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: 18441337 = 61 ⋅302317.
It is a cyclic number.
It is not a de Polignac number, because 73314481 - 29 = 73313969 is a prime.
It is a super-2 number, since 2×733144812 = 10750026248598722, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (73314401) 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, 441571 + ... + 441736.
It is an arithmetic number, because the mean of its divisors is an integer number (18549468).
Almost surely, 273314481 is an apocalyptic number.
It is an amenable number.
73314481 is a deficient number, since it is larger than the sum of its proper divisors (883391).
73314481 is an equidigital number, since it uses as much as digits as its factorization.
73314481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 883390.
The product of its digits is 8064, while the sum is 31.
The square root of 73314481 is about 8562.3875759043. The cubic root of 73314481 is about 418.5332072748.
The spelling of 73314481 in words is "seventy-three million, three hundred fourteen thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •