Base | Representation |
---|---|
bin | 1000110001001… |
… | …00110001001101 |
3 | 12010101202220100 |
4 | 10120210301031 |
5 | 122312112200 |
6 | 11144241313 |
7 | 1552113120 |
oct | 430446115 |
9 | 163352810 |
10 | 73550925 |
11 | 38576998 |
12 | 20770239 |
13 | 12312b76 |
14 | 9aa83b7 |
15 | 66ccd00 |
hex | 4624c4d |
73550925 has 144 divisors (see below), whose sum is σ = 165739392. Its totient is φ = 30412800.
The previous prime is 73550923. The next prime is 73550969. The reversal of 73550925 is 52905537.
It is not a de Polignac number, because 73550925 - 21 = 73550923 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 73550925.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (73550923) 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 143 ways as a sum of consecutive naturals, for example, 1097742 + ... + 1097808.
It is an arithmetic number, because the mean of its divisors is an integer number (1150968).
Almost surely, 273550925 is an apocalyptic number.
73550925 is a gapful number since it is divisible by the number (75) formed by its first and last digit.
It is an amenable number.
73550925 is an abundant number, since it is smaller than the sum of its proper divisors (92188467).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
73550925 is a wasteful number, since it uses less digits than its factorization.
73550925 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148 (or 140 counting only the distinct ones).
The product of its (nonzero) digits is 47250, while the sum is 36.
The square root of 73550925 is about 8576.1835917849. The cubic root of 73550925 is about 418.9826567820.
The spelling of 73550925 in words is "seventy-three million, five hundred fifty thousand, nine hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •