Base | Representation |
---|---|
bin | 11001101100011011001100… |
… | …110001010111100110110011 |
3 | 112211010002010210122212022022 |
4 | 121230123030301113212303 |
5 | 104302424220403122241 |
6 | 1040201155450102055 |
7 | 32542162041246113 |
oct | 3154331461274663 |
9 | 484102123585268 |
10 | 113004025051571 |
11 | 33008813150775 |
12 | 10810b2b41a92b |
13 | 4b09306984584 |
14 | 1dc95d162d043 |
15 | d0e7624c954b |
hex | 66c6ccc579b3 |
113004025051571 has 4 divisors (see below), whose sum is σ = 113008591080000. Its totient is φ = 112999459023144.
The previous prime is 113004025051553. The next prime is 113004025051597. The reversal of 113004025051571 is 175150520400311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113004025051571 is a prime.
It is a super-2 number, since 2×1130040250515712 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113004025051501) 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, 2282977091 + ... + 2283026588.
It is an arithmetic number, because the mean of its divisors is an integer number (28252147770000).
Almost surely, 2113004025051571 is an apocalyptic number.
113004025051571 is a deficient number, since it is larger than the sum of its proper divisors (4566028429).
113004025051571 is an equidigital number, since it uses as much as digits as its factorization.
113004025051571 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4566028428.
The product of its (nonzero) digits is 21000, while the sum is 35.
Adding to 113004025051571 its reverse (175150520400311), we get a palindrome (288154545451882).
The spelling of 113004025051571 in words is "one hundred thirteen trillion, four billion, twenty-five million, fifty-one thousand, five hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •