Base | Representation |
---|---|
bin | 110100101011110101… |
… | …1001111000110010101 |
3 | 101211000221001122212120 |
4 | 1221113223033012111 |
5 | 3323202331222100 |
6 | 123550441010153 |
7 | 11113500665253 |
oct | 1512753170625 |
9 | 354027048776 |
10 | 113140101525 |
11 | 43a89701940 |
12 | 19b16483959 |
13 | a890c25a49 |
14 | 56942595d3 |
15 | 2e22b130a0 |
hex | 1a57acf195 |
113140101525 has 48 divisors (see below), whose sum is σ = 206084184768. Its totient is φ = 54312640000.
The previous prime is 113140101523. The next prime is 113140101533. The reversal of 113140101525 is 525101041311.
It is not a de Polignac number, because 113140101525 - 21 = 113140101523 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113140101495 and 113140101504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113140101523) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 595584 + ... + 762233.
It is an arithmetic number, because the mean of its divisors is an integer number (4293420516).
Almost surely, 2113140101525 is an apocalyptic number.
113140101525 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
113140101525 is a deficient number, since it is larger than the sum of its proper divisors (92944083243).
113140101525 is a wasteful number, since it uses less digits than its factorization.
113140101525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1357942 (or 1357937 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 24.
Adding to 113140101525 its reverse (525101041311), we get a palindrome (638241142836).
The spelling of 113140101525 in words is "one hundred thirteen billion, one hundred forty million, one hundred one thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •