Base | Representation |
---|---|
bin | 1000001000011… |
… | …0101011011100 |
3 | 2101011202202000 |
4 | 2002012223130 |
5 | 32212343301 |
6 | 3215002300 |
7 | 562616424 |
oct | 202065334 |
9 | 71152660 |
10 | 34106076 |
11 | 18285444 |
12 | b509390 |
13 | 70b1c14 |
14 | 475b484 |
15 | 2eda786 |
hex | 2086adc |
34106076 has 96 divisors (see below), whose sum is σ = 93327360. Its totient is φ = 10756800.
The previous prime is 34106047. The next prime is 34106089. The reversal of 34106076 is 67060143.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 204145 + ... + 204311.
It is an arithmetic number, because the mean of its divisors is an integer number (972160).
Almost surely, 234106076 is an apocalyptic number.
34106076 is a gapful number since it is divisible by the number (36) 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 34106076, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (46663680).
34106076 is an abundant number, since it is smaller than the sum of its proper divisors (59221284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
34106076 is a wasteful number, since it uses less digits than its factorization.
34106076 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272 (or 264 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 27.
The square root of 34106076 is about 5840.0407532825. The cubic root of 34106076 is about 324.2977372868.
The spelling of 34106076 in words is "thirty-four million, one hundred six thousand, seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •