Base | Representation |
---|---|
bin | 100000001111100110… |
… | …001011110000000000 |
3 | 10022100211021122220000 |
4 | 200033212023300000 |
5 | 1031401034444313 |
6 | 23523240520000 |
7 | 2333644045224 |
oct | 401746136000 |
9 | 108324248800 |
10 | 34621406208 |
11 | 13756976a04 |
12 | 6862780000 |
13 | 335996889c |
14 | 1966118784 |
15 | d796e9673 |
hex | 80f98bc00 |
34621406208 has 440 divisors, whose sum is σ = 107856790272. Its totient is φ = 11054555136.
The previous prime is 34621406207. The next prime is 34621406221. The reversal of 34621406208 is 80260412643.
34621406208 is a `hidden beast` number, since 3 + 4 + 6 + 21 + 4 + 0 + 620 + 8 = 666.
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 (34621406201) 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 39 ways as a sum of consecutive naturals, for example, 323564491 + ... + 323564597.
Almost surely, 234621406208 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 34621406208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (53928395136).
34621406208 is an abundant number, since it is smaller than the sum of its proper divisors (73235384064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
34621406208 is a wasteful number, since it uses less digits than its factorization.
34621406208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 269 (or 242 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 36.
The spelling of 34621406208 in words is "thirty-four billion, six hundred twenty-one million, four hundred six thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •