Base | Representation |
---|---|
bin | 1011111011110000101110… |
… | …1100001001010111000011 |
3 | 1201110101102102202121222221 |
4 | 2332330023230021113003 |
5 | 3204434431212230311 |
6 | 43523503551111511 |
7 | 2522661400030024 |
oct | 276741354112703 |
9 | 51411372677887 |
10 | 13121321211331 |
11 | 41a97a282a503 |
12 | 157abbbb12597 |
13 | 7424487c6328 |
14 | 33510aa10c4b |
15 | 17b4b061c671 |
hex | bef0bb095c3 |
13121321211331 has 16 divisors (see below), whose sum is σ = 13556824879104. Its totient is φ = 12694021782624.
The previous prime is 13121321211307. The next prime is 13121321211337. The reversal of 13121321211331 is 13311212312131.
It is a cyclic number.
It is not a de Polignac number, because 13121321211331 - 221 = 13121319114179 is a prime.
It is a super-2 number, since 2×131213212113312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13121321211296 and 13121321211305.
It is not an unprimeable number, because it can be changed into a prime (13121321211337) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4882561 + ... + 7076866.
It is an arithmetic number, because the mean of its divisors is an integer number (847301554944).
Almost surely, 213121321211331 is an apocalyptic number.
13121321211331 is a deficient number, since it is larger than the sum of its proper divisors (435503667773).
13121321211331 is a wasteful number, since it uses less digits than its factorization.
13121321211331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11959770.
The product of its digits is 648, while the sum is 25.
Adding to 13121321211331 its reverse (13311212312131), we get a palindrome (26432533523462).
The spelling of 13121321211331 in words is "thirteen trillion, one hundred twenty-one billion, three hundred twenty-one million, two hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •