Base | Representation |
---|---|
bin | 1000110101000… |
… | …01100111011100 |
3 | 12011100202101011 |
4 | 10122201213130 |
5 | 122424443200 |
6 | 11203225004 |
7 | 1556343034 |
oct | 432414734 |
9 | 164322334 |
10 | 74062300 |
11 | 38896114 |
12 | 20978164 |
13 | 12461860 |
14 | 9b9c8c4 |
15 | 677e5ba |
hex | 46a19dc |
74062300 has 72 divisors (see below), whose sum is σ = 180675936. Its totient is φ = 26146560.
The previous prime is 74062273. The next prime is 74062309. The reversal of 74062300 is 326047.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (74062309) 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, 28662 + ... + 31138.
It is an arithmetic number, because the mean of its divisors is an integer number (2509388).
Almost surely, 274062300 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 74062300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (90337968).
74062300 is an abundant number, since it is smaller than the sum of its proper divisors (106613636).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
74062300 is a wasteful number, since it uses less digits than its factorization.
74062300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2527 (or 2520 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 22.
The square root of 74062300 is about 8605.9456191635. The cubic root of 74062300 is about 419.9514305136.
Adding to 74062300 its reverse (326047), we get a palindrome (74388347).
The spelling of 74062300 in words is "seventy-four million, sixty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •