Base | Representation |
---|---|
bin | 1011010011100… |
… | …01001011010100 |
3 | 20121110010201200 |
4 | 11221301023110 |
5 | 143234213122 |
6 | 13224352500 |
7 | 2231042040 |
oct | 551611324 |
9 | 217403650 |
10 | 94835412 |
11 | 49594281 |
12 | 27915730 |
13 | 16855b39 |
14 | c849020 |
15 | 84d45ac |
hex | 5a712d4 |
94835412 has 72 divisors (see below), whose sum is σ = 275184000. Its totient is φ = 26975808.
The previous prime is 94835393. The next prime is 94835413. The reversal of 94835412 is 21453849.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (94835413) 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 23 ways as a sum of consecutive naturals, for example, 67089 + ... + 68487.
It is an arithmetic number, because the mean of its divisors is an integer number (3822000).
Almost surely, 294835412 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 94835412, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (137592000).
94835412 is an abundant number, since it is smaller than the sum of its proper divisors (180348588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
94835412 is a wasteful number, since it uses less digits than its factorization.
94835412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1685 (or 1680 counting only the distinct ones).
The product of its digits is 34560, while the sum is 36.
The square root of 94835412 is about 9738.3474984209. The cubic root of 94835412 is about 456.0266027878.
The spelling of 94835412 in words is "ninety-four million, eight hundred thirty-five thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •