Base | Representation |
---|---|
bin | 111110100111011110… |
… | …0101101111010101101 |
3 | 110212002100020212120012 |
4 | 1331032330231322231 |
5 | 4200342420310431 |
6 | 141435103103005 |
7 | 12500153416124 |
oct | 1751674557255 |
9 | 425070225505 |
10 | 134468525741 |
11 | 52033a82710 |
12 | 220892a1a65 |
13 | c8ac8ab2c4 |
14 | 6718b40abb |
15 | 37702d622b |
hex | 1f4ef2dead |
134468525741 has 8 divisors (see below), whose sum is σ = 146695815264. Its totient is φ = 122241715920.
The previous prime is 134468525729. The next prime is 134468525771. The reversal of 134468525741 is 147525864431.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 134468525741 - 230 = 133394783917 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 134468525741.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134468525771) 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, 725135 + ... + 891491.
It is an arithmetic number, because the mean of its divisors is an integer number (18336976908).
Almost surely, 2134468525741 is an apocalyptic number.
134468525741 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
134468525741 is a deficient number, since it is larger than the sum of its proper divisors (12227289523).
134468525741 is a wasteful number, since it uses less digits than its factorization.
134468525741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239851.
The product of its digits is 3225600, while the sum is 50.
The spelling of 134468525741 in words is "one hundred thirty-four billion, four hundred sixty-eight million, five hundred twenty-five thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •