Base | Representation |
---|---|
bin | 10011000101001100001… |
… | …001010000011010011111 |
3 | 11122100112202010122200001 |
4 | 103011030021100122133 |
5 | 132440411041121343 |
6 | 2442213153515131 |
7 | 163506545344306 |
oct | 23051411203237 |
9 | 4570482118601 |
10 | 1311242520223 |
11 | 466105245019 |
12 | 192164572aa7 |
13 | 9685a345a7c |
14 | 4767074943d |
15 | 24195e1c44d |
hex | 1314c25069f |
1311242520223 has 4 divisors (see below), whose sum is σ = 1314284846688. Its totient is φ = 1308200193760.
The previous prime is 1311242520191. The next prime is 1311242520227. The reversal of 1311242520223 is 3220252421131.
It is a happy number.
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 1311242520223 - 25 = 1311242520191 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1311242520191 and 1311242520200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311242520227) 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, 1521162586 + ... + 1521163447.
It is an arithmetic number, because the mean of its divisors is an integer number (328571211672).
Almost surely, 21311242520223 is an apocalyptic number.
1311242520223 is a deficient number, since it is larger than the sum of its proper divisors (3042326465).
1311242520223 is an equidigital number, since it uses as much as digits as its factorization.
1311242520223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3042326464.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 1311242520223 its reverse (3220252421131), we get a palindrome (4531494941354).
The spelling of 1311242520223 in words is "one trillion, three hundred eleven billion, two hundred forty-two million, five hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •