Base | Representation |
---|---|
bin | 1100000110010101100101… |
… | …0100101100000001010001 |
3 | 1202002202101210121211001011 |
4 | 3001211121110230001101 |
5 | 3220424032122423441 |
6 | 44143153002010521 |
7 | 2542053021633151 |
oct | 301453124540121 |
9 | 52082353554034 |
10 | 13303012311121 |
11 | 4269859705a15 |
12 | 15aa267aa6a41 |
13 | 7566128bc030 |
14 | 33dc25256761 |
15 | 18109651c581 |
hex | c195952c051 |
13303012311121 has 32 divisors (see below), whose sum is σ = 14857619374080. Its totient is φ = 11828030529600.
The previous prime is 13303012311119. The next prime is 13303012311151. The reversal of 13303012311121 is 12111321030331.
It is a cyclic number.
It is not a de Polignac number, because 13303012311121 - 21 = 13303012311119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13303012311092 and 13303012311101.
It is not an unprimeable number, because it can be changed into a prime (13303012311151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 621073950 + ... + 621095368.
It is an arithmetic number, because the mean of its divisors is an integer number (464300605440).
Almost surely, 213303012311121 is an apocalyptic number.
It is an amenable number.
13303012311121 is a deficient number, since it is larger than the sum of its proper divisors (1554607062959).
13303012311121 is a wasteful number, since it uses less digits than its factorization.
13303012311121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28597.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 13303012311121 its reverse (12111321030331), we get a palindrome (25414333341452).
The spelling of 13303012311121 in words is "thirteen trillion, three hundred three billion, twelve million, three hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •