Base | Representation |
---|---|
bin | 111110101011111000… |
… | …1101000110010111101 |
3 | 110212110122220122101020 |
4 | 1331113301220302331 |
5 | 4201143323204000 |
6 | 141501513134353 |
7 | 12503632233405 |
oct | 1752761506275 |
9 | 425418818336 |
10 | 134616616125 |
11 | 520aa630162 |
12 | 2210a9ba3b9 |
13 | c90448bc54 |
14 | 673068d805 |
15 | 377d2d9ba0 |
hex | 1f57c68cbd |
134616616125 has 16 divisors (see below), whose sum is σ = 224002049856. Its totient is φ = 71795528400.
The previous prime is 134616616111. The next prime is 134616616129. The reversal of 134616616125 is 521616616431.
It is not a de Polignac number, because 134616616125 - 25 = 134616616093 is a prime.
It is a super-2 number, since 2×1346166161252 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134616616129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 179488447 + ... + 179489196.
It is an arithmetic number, because the mean of its divisors is an integer number (14000128116).
Almost surely, 2134616616125 is an apocalyptic number.
134616616125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
134616616125 is a deficient number, since it is larger than the sum of its proper divisors (89385433731).
134616616125 is an equidigital number, since it uses as much as digits as its factorization.
134616616125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 358977661 (or 358977651 counting only the distinct ones).
The product of its digits is 155520, while the sum is 42.
The spelling of 134616616125 in words is "one hundred thirty-four billion, six hundred sixteen million, six hundred sixteen thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •