Base | Representation |
---|---|
bin | 1111011001110000… |
… | …0100011110011100 |
3 | 101200010220002011010 |
4 | 3312130010132130 |
5 | 31431421203000 |
6 | 1522133455220 |
7 | 204313060560 |
oct | 36634043634 |
9 | 11603802133 |
10 | 4134553500 |
11 | 1831936270 |
12 | 9747a1510 |
13 | 50b77297c |
14 | 2b317b6a0 |
15 | 192ea2d50 |
hex | f670479c |
4134553500 has 192 divisors, whose sum is σ = 15011103744. Its totient is φ = 859104000.
The previous prime is 4134553427. The next prime is 4134553523. The reversal of 4134553500 is 53554314.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 97602 + ... + 133398.
It is an arithmetic number, because the mean of its divisors is an integer number (78182832).
Almost surely, 24134553500 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 4134553500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7505551872).
4134553500 is an abundant number, since it is smaller than the sum of its proper divisors (10876550244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4134553500 is a wasteful number, since it uses less digits than its factorization.
4134553500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35837 (or 35825 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 30.
The square root of 4134553500 is about 64300.4937772643. The cubic root of 4134553500 is about 1605.0043186576.
The spelling of 4134553500 in words is "four billion, one hundred thirty-four million, five hundred fifty-three thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •