Base | Representation |
---|---|
bin | 11110111110011011100010 |
3 | 120021112121000 |
4 | 132332123202 |
5 | 4034320114 |
6 | 450012430 |
7 | 126006366 |
oct | 36763342 |
9 | 16245530 |
10 | 8120034 |
11 | 464677a |
12 | 2877116 |
13 | 18b3c70 |
14 | 11152a6 |
15 | aa5e09 |
hex | 7be6e2 |
8120034 has 64 divisors (see below), whose sum is σ = 19958400. Its totient is φ = 2431296.
The previous prime is 8120027. The next prime is 8120039. The reversal of 8120034 is 4300218.
It is a happy number.
It is a super-2 number, since 2×81200342 = 131869904322312, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 8119989 and 8120016.
It is not an unprimeable number, because it can be changed into a prime (8120039) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 30052 + ... + 30320.
It is an arithmetic number, because the mean of its divisors is an integer number (311850).
Almost surely, 28120034 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 8120034, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9979200).
8120034 is an abundant number, since it is smaller than the sum of its proper divisors (11838366).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8120034 is a wasteful number, since it uses less digits than its factorization.
8120034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336 (or 330 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
The square root of 8120034 is about 2849.5673355792. The cubic root of 8120034 is about 200.9953217891.
The spelling of 8120034 in words is "eight million, one hundred twenty thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •