Base | Representation |
---|---|
bin | 110100110000101001… |
… | …0001100111101011011 |
3 | 101211110011101222010211 |
4 | 1221201102030331123 |
5 | 3324020113430243 |
6 | 124014440151551 |
7 | 11120466153544 |
oct | 1514122147533 |
9 | 354404358124 |
10 | 113301311323 |
11 | 44061700182 |
12 | 19b604685b7 |
13 | a8b844b065 |
14 | 56ab8214cb |
15 | 2e31d58d9d |
hex | 1a6148cf5b |
113301311323 has 16 divisors (see below), whose sum is σ = 122415165216. Its totient is φ = 104465687040.
The previous prime is 113301311281. The next prime is 113301311363. The reversal of 113301311323 is 323113103311.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113301311323 is a prime.
It is a super-2 number, since 2×1133013113232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113301311294 and 113301311303.
It is not an unprimeable number, because it can be changed into a prime (113301311363) 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, 500440 + ... + 690682.
It is an arithmetic number, because the mean of its divisors is an integer number (7650947826).
Almost surely, 2113301311323 is an apocalyptic number.
113301311323 is a deficient number, since it is larger than the sum of its proper divisors (9113853893).
113301311323 is a wasteful number, since it uses less digits than its factorization.
113301311323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190974.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 113301311323 its reverse (323113103311), we get a palindrome (436414414634).
The spelling of 113301311323 in words is "one hundred thirteen billion, three hundred one million, three hundred eleven thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •