Base | Representation |
---|---|
bin | 11001101100100001111001… |
… | …000110011000110111011011 |
3 | 112211010202200121200112201201 |
4 | 121230201321012120313123 |
5 | 104303033430032211303 |
6 | 1040204344514255031 |
7 | 32542535110503655 |
oct | 3154417106306733 |
9 | 484122617615651 |
10 | 113011211210203 |
11 | 33010870594049 |
12 | 108123b5b87477 |
13 | 4b09bb0709647 |
14 | 1dc9ab3ba76d5 |
15 | d0ea3331681d |
hex | 66c879198ddb |
113011211210203 has 4 divisors (see below), whose sum is σ = 113011338705768. Its totient is φ = 113011083714640.
The previous prime is 113011211210167. The next prime is 113011211210213. The reversal of 113011211210203 is 302012112110311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113011211210203 is a prime.
It is a super-2 number, since 2×1130112112102032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113011211210213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 62408818 + ... + 64194103.
It is an arithmetic number, because the mean of its divisors is an integer number (28252834676442).
Almost surely, 2113011211210203 is an apocalyptic number.
113011211210203 is a deficient number, since it is larger than the sum of its proper divisors (127495565).
113011211210203 is an equidigital number, since it uses as much as digits as its factorization.
113011211210203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127495564.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 113011211210203 its reverse (302012112110311), we get a palindrome (415023323320514).
The spelling of 113011211210203 in words is "one hundred thirteen trillion, eleven billion, two hundred eleven million, two hundred ten thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •