Base | Representation |
---|---|
bin | 11001110101101100111111… |
… | …111111101011101010001111 |
3 | 112220101000212102111222121020 |
4 | 121311230333333223222033 |
5 | 104343401011003442000 |
6 | 1041410123024005223 |
7 | 32636223055305525 |
oct | 3165547777535217 |
9 | 486330772458536 |
10 | 113641613343375 |
11 | 33234157113237 |
12 | 108b460a460813 |
13 | 4b54486b39460 |
14 | 200c3d7a54315 |
15 | d2112c243ba0 |
hex | 675b3ffeba8f |
113641613343375 has 64 divisors (see below), whose sum is σ = 203675298398208. Its totient is φ = 55938528528000.
The previous prime is 113641613343371. The next prime is 113641613343383. The reversal of 113641613343375 is 573343316146311.
It is not a de Polignac number, because 113641613343375 - 22 = 113641613343371 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113641613343371) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 32004604 + ... + 35377646.
It is an arithmetic number, because the mean of its divisors is an integer number (3182426537472).
Almost surely, 2113641613343375 is an apocalyptic number.
113641613343375 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
113641613343375 is a deficient number, since it is larger than the sum of its proper divisors (90033685054833).
113641613343375 is a wasteful number, since it uses less digits than its factorization.
113641613343375 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3379985 (or 3379975 counting only the distinct ones).
The product of its digits is 4898880, while the sum is 51.
Adding to 113641613343375 its reverse (573343316146311), we get a palindrome (686984929489686).
The spelling of 113641613343375 in words is "one hundred thirteen trillion, six hundred forty-one billion, six hundred thirteen million, three hundred forty-three thousand, three hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •