Base | Representation |
---|---|
bin | 110100101000010010… |
… | …1010010110000010001 |
3 | 101210201122010220202021 |
4 | 1221100211102300101 |
5 | 3322431400244441 |
6 | 123530550251441 |
7 | 11110524345163 |
oct | 1512045226021 |
9 | 353648126667 |
10 | 113021103121 |
11 | 43a28514653 |
12 | 19aa2656b81 |
13 | a87238c9a4 |
14 | 5682520933 |
15 | 2e174593d1 |
hex | 1a50952c11 |
113021103121 has 12 divisors (see below), whose sum is σ = 115740450612. Its totient is φ = 110364255456.
The previous prime is 113021103119. The next prime is 113021103149. The reversal of 113021103121 is 121301120311.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 101251240000 + 11769863121 = 318200^2 + 108489^2 .
It is not a de Polignac number, because 113021103121 - 21 = 113021103119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113021103095 and 113021103104.
It is not an unprimeable number, because it can be changed into a prime (113021103101) 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, 12785115 + ... + 12793951.
It is an arithmetic number, because the mean of its divisors is an integer number (9645037551).
Almost surely, 2113021103121 is an apocalyptic number.
It is an amenable number.
113021103121 is a deficient number, since it is larger than the sum of its proper divisors (2719347491).
113021103121 is an frugal number, since it uses more digits than its factorization.
113021103121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15840 (or 15797 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 113021103121 its reverse (121301120311), we get a palindrome (234322223432).
The spelling of 113021103121 in words is "one hundred thirteen billion, twenty-one million, one hundred three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •