Base | Representation |
---|---|
bin | 111110011100100000… |
… | …0100101100110110101 |
3 | 110211010200122020221110 |
4 | 1330321000211212311 |
5 | 4144114203112100 |
6 | 141334353505233 |
7 | 12455063642241 |
oct | 1747100454665 |
9 | 424120566843 |
10 | 134100441525 |
11 | 51965226586 |
12 | 21ba5b72219 |
13 | c8515629ab |
14 | 66c1cc7421 |
15 | 374cd29250 |
hex | 1f390259b5 |
134100441525 has 48 divisors (see below), whose sum is σ = 233485056000. Its totient is φ = 67726042560.
The previous prime is 134100441499. The next prime is 134100441533. The reversal of 134100441525 is 525144001431.
It is not a de Polignac number, because 134100441525 - 28 = 134100441269 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 134100441492 and 134100441501.
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 47 ways as a sum of consecutive naturals, for example, 3398962 + ... + 3438188.
It is an arithmetic number, because the mean of its divisors is an integer number (4864272000).
Almost surely, 2134100441525 is an apocalyptic number.
134100441525 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
134100441525 is a deficient number, since it is larger than the sum of its proper divisors (99384614475).
134100441525 is a wasteful number, since it uses less digits than its factorization.
134100441525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41658 (or 41653 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 134100441525 its reverse (525144001431), we get a palindrome (659244442956).
The spelling of 134100441525 in words is "one hundred thirty-four billion, one hundred million, four hundred forty-one thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •