Base | Representation |
---|---|
bin | 110100101011101100… |
… | …0001010100100100011 |
3 | 101211000120122200010222 |
4 | 1221113120022210203 |
5 | 3323200041232433 |
6 | 123550141513255 |
7 | 11113410334142 |
oct | 1512730124443 |
9 | 354016580128 |
10 | 113135102243 |
11 | 43a868a78a9 |
12 | 19b1487282b |
13 | a88cb953a7 |
14 | 5693717759 |
15 | 2e22476b98 |
hex | 1a5760a923 |
113135102243 has 8 divisors (see below), whose sum is σ = 114648697296. Its totient is φ = 111625091200.
The previous prime is 113135102219. The next prime is 113135102257. The reversal of 113135102243 is 342201531311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 113135102243 - 28 = 113135101987 is a prime.
It is a super-3 number, since 3×1131351022433 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113135102203) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 832418 + ... + 958743.
It is an arithmetic number, because the mean of its divisors is an integer number (14331087162).
Almost surely, 2113135102243 is an apocalyptic number.
113135102243 is a deficient number, since it is larger than the sum of its proper divisors (1513595053).
113135102243 is an equidigital number, since it uses as much as digits as its factorization.
113135102243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1792005.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 113135102243 its reverse (342201531311), we get a palindrome (455336633554).
The spelling of 113135102243 in words is "one hundred thirteen billion, one hundred thirty-five million, one hundred two thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •