Base | Representation |
---|---|
bin | 100000001000011011… |
… | …010101000000000000 |
3 | 10022001102221111020021 |
4 | 200020123111000000 |
5 | 1031124241320000 |
6 | 23503302423224 |
7 | 2330653452454 |
oct | 401033250000 |
9 | 108042844207 |
10 | 34501120000 |
11 | 136a4a8a116 |
12 | 682a431b14 |
13 | 333aa71609 |
14 | 1954166664 |
15 | d6dd8911a |
hex | 8086d5000 |
34501120000 has 130 divisors (see below), whose sum is σ = 86221070738. Its totient is φ = 13799424000.
The previous prime is 34501119959. The next prime is 34501120007. The reversal of 34501120000 is 2110543.
It can be written as a sum of positive squares in 5 ways, for example, as 10394210304 + 24106909696 = 101952^2 + 155264^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34501120007) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 2553262 + ... + 2566738.
Almost surely, 234501120000 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 34501120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (43110535369).
34501120000 is an abundant number, since it is smaller than the sum of its proper divisors (51719950738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
34501120000 is an frugal number, since it uses more digits than its factorization.
34501120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13521 (or 13484 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 16.
Adding to 34501120000 its reverse (2110543), we get a palindrome (34503230543).
The spelling of 34501120000 in words is "thirty-four billion, five hundred one million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •