Base | Representation |
---|---|
bin | 100000000000110… |
… | …0011110011011000 |
3 | 2202212012111122011 |
4 | 1000001203303120 |
5 | 4144440304431 |
6 | 254330435304 |
7 | 35422062310 |
oct | 10001436330 |
9 | 2685174564 |
10 | 1074150616 |
11 | 50136a290 |
12 | 25b892b34 |
13 | 1416ccca6 |
14 | a2930440 |
15 | 6447bcb1 |
hex | 40063cd8 |
1074150616 has 64 divisors (see below), whose sum is σ = 2545505280. Its totient is φ = 412750080.
The previous prime is 1074150611. The next prime is 1074150653. The reversal of 1074150616 is 6160514701.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1074150611) 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 15 ways as a sum of consecutive naturals, for example, 33025 + ... + 56911.
It is an arithmetic number, because the mean of its divisors is an integer number (39773520).
Almost surely, 21074150616 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 1074150616, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1272752640).
1074150616 is an abundant number, since it is smaller than the sum of its proper divisors (1471354664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1074150616 is a wasteful number, since it uses less digits than its factorization.
1074150616 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23984 (or 23980 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 31.
The square root of 1074150616 is about 32774.2370773142. The cubic root of 1074150616 is about 1024.1299349889.
The spelling of 1074150616 in words is "one billion, seventy-four million, one hundred fifty thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •