Base | Representation |
---|---|
bin | 11001110001001100111011… |
… | …101011100011100110010111 |
3 | 112212021110111002010102112112 |
4 | 121301030323223203212113 |
5 | 104323314024122011203 |
6 | 1041012050312341235 |
7 | 32604663061366304 |
oct | 3161147353434627 |
9 | 485243432112475 |
10 | 113332303313303 |
11 | 33124a61720608 |
12 | 108646870a481b |
13 | 4b3126225a319 |
14 | 1ddb4542760ab |
15 | d180775676d8 |
hex | 67133bae3997 |
113332303313303 has 16 divisors (see below), whose sum is σ = 115654729160256. Its totient is φ = 111035093414400.
The previous prime is 113332303313297. The next prime is 113332303313353. The reversal of 113332303313303 is 303313303233311.
It is a cyclic number.
It is not a de Polignac number, because 113332303313303 - 24 = 113332303313287 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 113332303313303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113332303313353) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9292925 + ... + 17692457.
It is an arithmetic number, because the mean of its divisors is an integer number (7228420572516).
Almost surely, 2113332303313303 is an apocalyptic number.
113332303313303 is a deficient number, since it is larger than the sum of its proper divisors (2322425846953).
113332303313303 is a wasteful number, since it uses less digits than its factorization.
113332303313303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8401034.
The product of its (nonzero) digits is 39366, while the sum is 32.
Adding to 113332303313303 its reverse (303313303233311), we get a palindrome (416645606546614).
The spelling of 113332303313303 in words is "one hundred thirteen trillion, three hundred thirty-two billion, three hundred three million, three hundred thirteen thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •