Base | Representation |
---|---|
bin | 111110011100100100… |
… | …0100010010100101001 |
3 | 110211010211120010020112 |
4 | 1330321020202110221 |
5 | 4144120221301400 |
6 | 141334510304105 |
7 | 12455120441204 |
oct | 1747110422451 |
9 | 424124503215 |
10 | 134102525225 |
11 | 5196641a049 |
12 | 21ba67b8035 |
13 | c851b12256 |
14 | 66c22aa93b |
15 | 374d0db835 |
hex | 1f39222529 |
134102525225 has 48 divisors (see below), whose sum is σ = 178924298112. Its totient is φ = 99466498560.
The previous prime is 134102525197. The next prime is 134102525239. The reversal of 134102525225 is 522525201431.
It is not a de Polignac number, because 134102525225 - 234 = 116922656041 is a prime.
It is a super-2 number, since 2×1341025252252 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 134102525191 and 134102525200.
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 47 ways as a sum of consecutive naturals, for example, 2502917 + ... + 2555933.
It is an arithmetic number, because the mean of its divisors is an integer number (3727589544).
Almost surely, 2134102525225 is an apocalyptic number.
It is an amenable number.
134102525225 is a deficient number, since it is larger than the sum of its proper divisors (44821772887).
134102525225 is a wasteful number, since it uses less digits than its factorization.
134102525225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53186 (or 53181 counting only the distinct ones).
The product of its (nonzero) digits is 24000, while the sum is 32.
Adding to 134102525225 its reverse (522525201431), we get a palindrome (656627726656).
The spelling of 134102525225 in words is "one hundred thirty-four billion, one hundred two million, five hundred twenty-five thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •