Base | Representation |
---|---|
bin | 10011000101010010001… |
… | …001011001110110111011 |
3 | 11122100210202121211211000 |
4 | 103011102021121312323 |
5 | 132441112331102303 |
6 | 2442231152140043 |
7 | 163512210322140 |
oct | 23052211316673 |
9 | 4570722554730 |
10 | 1311343222203 |
11 | 4661570759a3 |
12 | 192192237623 |
13 | 96875173c41 |
14 | 4767dc803c7 |
15 | 2419ebaeda3 |
hex | 13152259dbb |
1311343222203 has 16 divisors (see below), whose sum is σ = 2220263656960. Its totient is φ = 749338984008.
The previous prime is 1311343222201. The next prime is 1311343222237. The reversal of 1311343222203 is 3022223431131.
1311343222203 is a `hidden beast` number, since 1 + 3 + 1 + 1 + 3 + 432 + 2 + 220 + 3 = 666.
It is not a de Polignac number, because 1311343222203 - 21 = 1311343222201 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1311343222201) 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, 3469161775 + ... + 3469162152.
It is an arithmetic number, because the mean of its divisors is an integer number (138766478560).
Almost surely, 21311343222203 is an apocalyptic number.
1311343222203 is a deficient number, since it is larger than the sum of its proper divisors (908920434757).
1311343222203 is an equidigital number, since it uses as much as digits as its factorization.
1311343222203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6938323943 (or 6938323937 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 1311343222203 its reverse (3022223431131), we get a palindrome (4333566653334).
The spelling of 1311343222203 in words is "one trillion, three hundred eleven billion, three hundred forty-three million, two hundred twenty-two thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.216 sec. • engine limits •