Base | Representation |
---|---|
bin | 11001101111100100100001… |
… | …111110111011001011010111 |
3 | 112211212202010121200011122022 |
4 | 121233210201332323023113 |
5 | 104314444433434031203 |
6 | 1040444350534323355 |
7 | 32563614114624452 |
oct | 3157444176731327 |
9 | 484782117604568 |
10 | 113220203033303 |
11 | 33091466a71003 |
12 | 10846a00ab955b |
13 | 4b238088a4cb2 |
14 | 1dd5c5c172499 |
15 | d151b5d9ea38 |
hex | 66f921fbb2d7 |
113220203033303 has 16 divisors (see below), whose sum is σ = 114377052430080. Its totient is φ = 112065198576576.
The previous prime is 113220203033263. The next prime is 113220203033417. The reversal of 113220203033303 is 303330302022311.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 113220203033303 - 220 = 113220201984727 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113220203033803) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1718888576 + ... + 1718954442.
It is an arithmetic number, because the mean of its divisors is an integer number (7148565776880).
Almost surely, 2113220203033303 is an apocalyptic number.
113220203033303 is a deficient number, since it is larger than the sum of its proper divisors (1156849396777).
113220203033303 is a wasteful number, since it uses less digits than its factorization.
113220203033303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79606.
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 113220203033303 its reverse (303330302022311), we get a palindrome (416550505055614).
The spelling of 113220203033303 in words is "one hundred thirteen trillion, two hundred twenty billion, two hundred three million, thirty-three thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •