Base | Representation |
---|---|
bin | 1011111011001110011010… |
… | …1110000101111101101001 |
3 | 1201102111122120011221120100 |
4 | 2332303212232011331221 |
5 | 3204312100410430441 |
6 | 43515342021020013 |
7 | 2522214222545535 |
oct | 276634656057551 |
9 | 51374576157510 |
10 | 13112111030121 |
11 | 41a58a6931aa4 |
12 | 157926b554609 |
13 | 74160b63586c |
14 | 3348b5726bc5 |
15 | 17b121c74cb6 |
hex | bece6b85f69 |
13112111030121 has 12 divisors (see below), whose sum is σ = 18939766725360. Its totient is φ = 8741383910520.
The previous prime is 13112111030089. The next prime is 13112111030129. The reversal of 13112111030121 is 12103011121131.
13112111030121 is a `hidden beast` number, since 1 + 311 + 21 + 1 + 10 + 301 + 21 = 666.
It is not a de Polignac number, because 13112111030121 - 25 = 13112111030089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13112111030094 and 13112111030103.
It is not an unprimeable number, because it can be changed into a prime (13112111030129) 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, 2012590 + ... + 5502248.
It is an arithmetic number, because the mean of its divisors is an integer number (1578313893780).
Almost surely, 213112111030121 is an apocalyptic number.
It is an amenable number.
13112111030121 is a deficient number, since it is larger than the sum of its proper divisors (5827655695239).
13112111030121 is a wasteful number, since it uses less digits than its factorization.
13112111030121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3907156 (or 3907153 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
Adding to 13112111030121 its reverse (12103011121131), we get a palindrome (25215122151252).
The spelling of 13112111030121 in words is "thirteen trillion, one hundred twelve billion, one hundred eleven million, thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •