Base | Representation |
---|---|
bin | 1000101101110… |
… | …10010110010100 |
3 | 12002120121222000 |
4 | 10112322112110 |
5 | 122204140103 |
6 | 11131035300 |
7 | 1545316230 |
oct | 426722624 |
9 | 162517860 |
10 | 73115028 |
11 | 382a9448 |
12 | 2059bb30 |
13 | 121bc63c |
14 | 99d35c0 |
15 | 6643aa3 |
hex | 45ba594 |
73115028 has 96 divisors (see below), whose sum is σ = 229420800. Its totient is φ = 19657728.
The previous prime is 73114969. The next prime is 73115041. The reversal of 73115028 is 82051137.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 73114992 and 73115010.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 10008 + ... + 15696.
It is an arithmetic number, because the mean of its divisors is an integer number (2389800).
Almost surely, 273115028 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 73115028, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (114710400).
73115028 is an abundant number, since it is smaller than the sum of its proper divisors (156305772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
73115028 is a wasteful number, since it uses less digits than its factorization.
73115028 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5726 (or 5718 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 27.
The square root of 73115028 is about 8550.7326001928. The cubic root of 73115028 is about 418.1533208913.
The spelling of 73115028 in words is "seventy-three million, one hundred fifteen thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •