Base | Representation |
---|---|
bin | 11001101101110111011110… |
… | …001010100010111110001001 |
3 | 112211110112212120202020000100 |
4 | 121231313132022202332021 |
5 | 104311040122341042301 |
6 | 1040314503010000013 |
7 | 32552300166001614 |
oct | 3155673612427611 |
9 | 484415776666010 |
10 | 113103101112201 |
11 | 33046834a93512 |
12 | 1082817b876009 |
13 | 4b15765c38115 |
14 | 1dd030daa117b |
15 | d12110559286 |
hex | 66ddde2a2f89 |
113103101112201 has 12 divisors (see below), whose sum is σ = 171969627422320. Its totient is φ = 71433537544440.
The previous prime is 113103101112191. The next prime is 113103101112223. The reversal of 113103101112201 is 102211101301311.
113103101112201 is a `hidden beast` number, since 1 + 1 + 310 + 310 + 11 + 12 + 20 + 1 = 666.
It is not a de Polignac number, because 113103101112201 - 26 = 113103101112137 is a prime.
It is a super-2 number, since 2×1131031011122012 (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 (113103101112271) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 330710821795 + ... + 330710822136.
Almost surely, 2113103101112201 is an apocalyptic number.
It is an amenable number.
113103101112201 is a deficient number, since it is larger than the sum of its proper divisors (58866526310119).
113103101112201 is a wasteful number, since it uses less digits than its factorization.
113103101112201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 661421643956 (or 661421643953 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
Adding to 113103101112201 its reverse (102211101301311), we get a palindrome (215314202413512).
The spelling of 113103101112201 in words is "one hundred thirteen trillion, one hundred three billion, one hundred one million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •