Base | Representation |
---|---|
bin | 11111110111001000… |
… | …110011001100000000 |
3 | 10021022020010102022211 |
4 | 133313020303030000 |
5 | 1030031012101430 |
6 | 23414421311504 |
7 | 2320532062153 |
oct | 376710631400 |
9 | 107266112284 |
10 | 34211050240 |
11 | 13566278444 |
12 | 6769265594 |
13 | 32c293c6c3 |
14 | 1927819c9a |
15 | d5368c72a |
hex | 7f7233300 |
34211050240 has 144 divisors (see below), whose sum is σ = 87061056768. Its totient is φ = 12835749888.
The previous prime is 34211050213. The next prime is 34211050249. The reversal of 34211050240 is 4205011243.
It is not an unprimeable number, because it can be changed into a prime (34211050249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6808369 + ... + 6813391.
It is an arithmetic number, because the mean of its divisors is an integer number (604590672).
Almost surely, 234211050240 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 34211050240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (43530528384).
34211050240 is an abundant number, since it is smaller than the sum of its proper divisors (52850006528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
34211050240 is a wasteful number, since it uses less digits than its factorization.
34211050240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5374 (or 5360 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 22.
Adding to 34211050240 its reverse (4205011243), we get a palindrome (38416061483).
The spelling of 34211050240 in words is "thirty-four billion, two hundred eleven million, fifty thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •