Base | Representation |
---|---|
bin | 1000101101001… |
… | …00101101011001 |
3 | 12002102010101020 |
4 | 10112210231121 |
5 | 122143321033 |
6 | 11125113053 |
7 | 1544466636 |
oct | 426445531 |
9 | 162363336 |
10 | 73026393 |
11 | 382488a0 |
12 | 20558789 |
13 | 1218b1ab |
14 | 99ad18d |
15 | 66276b3 |
hex | 45a4b59 |
73026393 has 8 divisors (see below), whose sum is σ = 106220256. Its totient is φ = 44258400.
The previous prime is 73026389. The next prime is 73026461. The reversal of 73026393 is 39362037.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 73026393 - 22 = 73026389 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 2212921 = 73026393 / (7 + 3 + 0 + 2 + 6 + 3 + 9 + 3).
It is not an unprimeable number, because it can be changed into a prime (73026593) 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 7 ways as a sum of consecutive naturals, for example, 1106428 + ... + 1106493.
It is an arithmetic number, because the mean of its divisors is an integer number (13277532).
Almost surely, 273026393 is an apocalyptic number.
It is an amenable number.
73026393 is a deficient number, since it is larger than the sum of its proper divisors (33193863).
73026393 is a wasteful number, since it uses less digits than its factorization.
73026393 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2212935.
The product of its (nonzero) digits is 20412, while the sum is 33.
The square root of 73026393 is about 8545.5481392360. The cubic root of 73026393 is about 417.9842812859.
It can be divided in two parts, 7302 and 6393, that added together give a triangular number (13695 = T165).
The spelling of 73026393 in words is "seventy-three million, twenty-six thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •