Base | Representation |
---|---|
bin | 11001111000010000010100… |
… | …010110010000011100100101 |
3 | 112220222210111122220001201211 |
4 | 121320100110112100130211 |
5 | 104404234131012112403 |
6 | 1042022444002551421 |
7 | 32655001510401613 |
oct | 3170202426203445 |
9 | 486883448801654 |
10 | 113816974722853 |
11 | 332a1565035136 |
12 | 109225aa668571 |
13 | 4b67b82760a1c |
14 | 2016ab177c6b3 |
15 | d259925cb06d |
hex | 678414590725 |
113816974722853 has 16 divisors (see below), whose sum is σ = 118644196319104. Its totient is φ = 109082094327360.
The previous prime is 113816974722799. The next prime is 113816974722887. The reversal of 113816974722853 is 358227479618311.
It is a cyclic number.
It is not a de Polignac number, because 113816974722853 - 217 = 113816974591781 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (67).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113816974722053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 44969368 + ... + 47432878.
It is an arithmetic number, because the mean of its divisors is an integer number (7415262269944).
Almost surely, 2113816974722853 is an apocalyptic number.
It is an amenable number.
113816974722853 is a deficient number, since it is larger than the sum of its proper divisors (4827221596251).
113816974722853 is a wasteful number, since it uses less digits than its factorization.
113816974722853 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2482252.
The product of its digits is 121927680, while the sum is 67.
The spelling of 113816974722853 in words is "one hundred thirteen trillion, eight hundred sixteen billion, nine hundred seventy-four million, seven hundred twenty-two thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •