Base | Representation |
---|---|
bin | 111110101000011110… |
… | …0011111010110010100 |
3 | 110212011200021120201211 |
4 | 1331100330133112110 |
5 | 4200430004124000 |
6 | 141442301031204 |
7 | 12501041211361 |
oct | 1752074372624 |
9 | 425150246654 |
10 | 134502020500 |
11 | 5205097a831 |
12 | 22098555504 |
13 | c8b6807ba3 |
14 | 671d37d468 |
15 | 37732007ba |
hex | 1f50f1f594 |
134502020500 has 24 divisors (see below), whose sum is σ = 293752413864. Its totient is φ = 53800808000.
The previous prime is 134502020467. The next prime is 134502020507. The reversal of 134502020500 is 5020205431.
It can be written as a sum of positive squares in 4 ways, for example, as 28181679876 + 106320340624 = 167874^2 + 326068^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134502020507) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 134501521 + ... + 134502520.
It is an arithmetic number, because the mean of its divisors is an integer number (12239683911).
Almost surely, 2134502020500 is an apocalyptic number.
134502020500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
134502020500 is an abundant number, since it is smaller than the sum of its proper divisors (159250393364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134502020500 is a wasteful number, since it uses less digits than its factorization.
134502020500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 269004060 (or 269004048 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 22.
Adding to 134502020500 its reverse (5020205431), we get a palindrome (139522225931).
The spelling of 134502020500 in words is "one hundred thirty-four billion, five hundred two million, twenty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •