Base | Representation |
---|---|
bin | 1100000110110100011111… |
… | …1010010100110011011001 |
3 | 1202010112211002102021221110 |
4 | 3001231013322110303121 |
5 | 3221043030342402301 |
6 | 44151044220530533 |
7 | 2542465450105200 |
oct | 301550772246331 |
9 | 52115732367843 |
10 | 13311310122201 |
11 | 42723275a2223 |
12 | 15ab9a29b0a49 |
13 | 757335a44810 |
14 | 3403b12c4237 |
15 | 1813cec430d6 |
hex | c1b47e94cd9 |
13311310122201 has 144 divisors (see below), whose sum is σ = 23043541457664. Its totient is φ = 6774488404992.
The previous prime is 13311310122193. The next prime is 13311310122281. The reversal of 13311310122201 is 10222101311331.
It is not a de Polignac number, because 13311310122201 - 23 = 13311310122193 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (13311310122281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 4086983365 + ... + 4086986621.
It is an arithmetic number, because the mean of its divisors is an integer number (160024593456).
Almost surely, 213311310122201 is an apocalyptic number.
It is an amenable number.
13311310122201 is a deficient number, since it is larger than the sum of its proper divisors (9732231335463).
13311310122201 is a wasteful number, since it uses less digits than its factorization.
13311310122201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5888 (or 5852 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 13311310122201 its reverse (10222101311331), we get a palindrome (23533411433532).
The spelling of 13311310122201 in words is "thirteen trillion, three hundred eleven billion, three hundred ten million, one hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •