Base | Representation |
---|---|
bin | 1000101111110… |
… | …00011001000000 |
3 | 12010001112120000 |
4 | 10113320121000 |
5 | 122240303102 |
6 | 11140320000 |
7 | 1550425143 |
oct | 427703100 |
9 | 163045500 |
10 | 73369152 |
11 | 3846236a |
12 | 206a3000 |
13 | 1227b1cc |
14 | 9a5c05a |
15 | 669401c |
hex | 45f8640 |
73369152 has 70 divisors (see below), whose sum is σ = 217504518. Its totient is φ = 24454656.
The previous prime is 73369139. The next prime is 73369169. The reversal of 73369152 is 25196337.
It can be written as a sum of positive squares in only one way, i.e., 59351616 + 14017536 = 7704^2 + 3744^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
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 9 ways as a sum of consecutive naturals, for example, 1893 + ... + 12260.
Almost surely, 273369152 is an apocalyptic number.
73369152 is a gapful number since it is divisible by the number (72) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 73369152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (108752259).
73369152 is an abundant number, since it is smaller than the sum of its proper divisors (144135366).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
73369152 is a wasteful number, since it uses less digits than its factorization.
73369152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14177 (or 14158 counting only the distinct ones).
The product of its digits is 34020, while the sum is 36.
The square root of 73369152 is about 8565.5794900287. The cubic root of 73369152 is about 418.6372155752.
The spelling of 73369152 in words is "seventy-three million, three hundred sixty-nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •