Base | Representation |
---|---|
bin | 1011111011110011101011… |
… | …0001000100011100111111 |
3 | 1201110110110110221122001002 |
4 | 2332330322301010130333 |
5 | 3204443040410443403 |
6 | 43524114203440515 |
7 | 2523020100263414 |
oct | 276747261043477 |
9 | 51413413848032 |
10 | 13122111031103 |
11 | 41aa068647818 |
12 | 157b1a052613b |
13 | 7425433235c9 |
14 | 33518388a10b |
15 | 17b509b33188 |
hex | bef3ac4473f |
13122111031103 has 4 divisors (see below), whose sum is σ = 13122156820920. Its totient is φ = 13122065241288.
The previous prime is 13122111031049. The next prime is 13122111031109. The reversal of 13122111031103 is 30113011122131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13122111031103 - 26 = 13122111031039 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 (13122111031109) 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, 22462325 + ... + 23039102.
It is an arithmetic number, because the mean of its divisors is an integer number (3280539205230).
Almost surely, 213122111031103 is an apocalyptic number.
13122111031103 is a deficient number, since it is larger than the sum of its proper divisors (45789817).
13122111031103 is an equidigital number, since it uses as much as digits as its factorization.
13122111031103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45789816.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 13122111031103 its reverse (30113011122131), we get a palindrome (43235122153234).
The spelling of 13122111031103 in words is "thirteen trillion, one hundred twenty-two billion, one hundred eleven million, thirty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •