Base | Representation |
---|---|
bin | 111110100000101101… |
… | …1000101011001111000 |
3 | 110211111112021010011012 |
4 | 1331001123011121320 |
5 | 4144411322331430 |
6 | 141400355253052 |
7 | 12461426550251 |
oct | 1750133053170 |
9 | 424445233135 |
10 | 134241605240 |
11 | 51a27982a06 |
12 | 220252aa188 |
13 | c874889912 |
14 | 66d6951b28 |
15 | 375a410695 |
hex | 1f416c5678 |
134241605240 has 32 divisors (see below), whose sum is σ = 304814664000. Its totient is φ = 53204010624.
The previous prime is 134241605237. The next prime is 134241605261. The reversal of 134241605240 is 42506142431.
It is a junction number, because it is equal to n+sod(n) for n = 134241605197 and 134241605206.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15390320 + ... + 15399039.
It is an arithmetic number, because the mean of its divisors is an integer number (9525458250).
Almost surely, 2134241605240 is an apocalyptic number.
134241605240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
134241605240 is an abundant number, since it is smaller than the sum of its proper divisors (170573058760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134241605240 is a wasteful number, since it uses less digits than its factorization.
134241605240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30789479 (or 30789475 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 32.
Adding to 134241605240 its reverse (42506142431), we get a palindrome (176747747671).
The spelling of 134241605240 in words is "one hundred thirty-four billion, two hundred forty-one million, six hundred five thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •