Base | Representation |
---|---|
bin | 11001110100001001010001… |
… | …000010011110010101111101 |
3 | 112212222210110021002212000001 |
4 | 121310021101002132111331 |
5 | 104340122201411334113 |
6 | 1041245012451234301 |
7 | 32625412241304550 |
oct | 3164112102362575 |
9 | 485883407085001 |
10 | 113534525105533 |
11 | 331a27a3646134 |
12 | 108979028a8991 |
13 | 4b4734b96ac4c |
14 | 2007159468697 |
15 | d1d460ab07dd |
hex | 67425109e57d |
113534525105533 has 8 divisors (see below), whose sum is σ = 129755447577152. Its totient is φ = 97314028783776.
The previous prime is 113534525105503. The next prime is 113534525105557. The reversal of 113534525105533 is 335501525435311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113534525105533 - 213 = 113534525097341 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113534525105503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 105966360 + ... + 107032417.
It is an arithmetic number, because the mean of its divisors is an integer number (16219430947144).
Almost surely, 2113534525105533 is an apocalyptic number.
It is an amenable number.
113534525105533 is a deficient number, since it is larger than the sum of its proper divisors (16220922471619).
113534525105533 is an equidigital number, since it uses as much as digits as its factorization.
113534525105533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213074931.
The product of its (nonzero) digits is 2025000, while the sum is 46.
The spelling of 113534525105533 in words is "one hundred thirteen trillion, five hundred thirty-four billion, five hundred twenty-five million, one hundred five thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •