Base | Representation |
---|---|
bin | 111110101000100100… |
… | …0101101000101100100 |
3 | 110212011220022021001102 |
4 | 1331101020231011210 |
5 | 4200431314110000 |
6 | 141442453415232 |
7 | 12501110345555 |
oct | 1752110550544 |
9 | 425156267042 |
10 | 134505222500 |
11 | 52052767510 |
12 | 2209963a518 |
13 | c8b738946c |
14 | 671d97432c |
15 | 37736343d5 |
hex | 1f5122d164 |
134505222500 has 60 divisors (see below), whose sum is σ = 320875724400. Its totient is φ = 48910980000.
The previous prime is 134505222493. The next prime is 134505222517. The reversal of 134505222500 is 5222505431.
134505222500 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 19 ways as a sum of consecutive naturals, for example, 2418050 + ... + 2473049.
It is an arithmetic number, because the mean of its divisors is an integer number (5347928740).
Almost surely, 2134505222500 is an apocalyptic number.
134505222500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
134505222500 is an abundant number, since it is smaller than the sum of its proper divisors (186370501900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134505222500 is a wasteful number, since it uses less digits than its factorization.
134505222500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4891134 (or 4891117 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 29.
Adding to 134505222500 its reverse (5222505431), we get a palindrome (139727727931).
The spelling of 134505222500 in words is "one hundred thirty-four billion, five hundred five million, two hundred twenty-two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •