Base | Representation |
---|---|
bin | 110100101111001010… |
… | …0010011111011101001 |
3 | 101211022200201221110111 |
4 | 1221132110103323221 |
5 | 3323414343020041 |
6 | 124005501214321 |
7 | 11116323100051 |
oct | 1513624237351 |
9 | 354280657414 |
10 | 113251532521 |
11 | 440365a0676 |
12 | 19b478613a1 |
13 | a8ab03c54a |
14 | 56a4d84561 |
15 | 2e2c7c4981 |
hex | 1a5e513ee9 |
113251532521 has 4 divisors (see below), whose sum is σ = 113478490000. Its totient is φ = 113024575044.
The previous prime is 113251532519. The next prime is 113251532539. The reversal of 113251532521 is 125235152311.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 125235152311 = 593 ⋅211189127.
It is a cyclic number.
It is not a de Polignac number, because 113251532521 - 21 = 113251532519 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113251532321) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 113477991 + ... + 113478988.
It is an arithmetic number, because the mean of its divisors is an integer number (28369622500).
Almost surely, 2113251532521 is an apocalyptic number.
It is an amenable number.
113251532521 is a deficient number, since it is larger than the sum of its proper divisors (226957479).
113251532521 is an equidigital number, since it uses as much as digits as its factorization.
113251532521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226957478.
The product of its digits is 9000, while the sum is 31.
Adding to 113251532521 its reverse (125235152311), we get a palindrome (238486684832).
The spelling of 113251532521 in words is "one hundred thirteen billion, two hundred fifty-one million, five hundred thirty-two thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •