Base | Representation |
---|---|
bin | 10011100010000010000… |
… | …010001100111001001101 |
3 | 11202022111000120100001111 |
4 | 103202002002030321031 |
5 | 133442322110132113 |
6 | 2504334200412021 |
7 | 165654151520206 |
oct | 23420202147115 |
9 | 4668430510044 |
10 | 1342211411533 |
11 | 478257394473 |
12 | 198167a77011 |
13 | 99754375525 |
14 | 48d6b7245ad |
15 | 24da9b3013d |
hex | 1388208ce4d |
1342211411533 has 2 divisors, whose sum is σ = 1342211411534. Its totient is φ = 1342211411532.
The previous prime is 1342211411521. The next prime is 1342211411537. The reversal of 1342211411533 is 3351141122431.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1342082861289 + 128550244 = 1158483^2 + 11338^2 .
It is a cyclic number.
It is not a de Polignac number, because 1342211411533 - 25 = 1342211411501 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1342211411495 and 1342211411504.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1342211411537) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 671105705766 + 671105705767.
It is an arithmetic number, because the mean of its divisors is an integer number (671105705767).
Almost surely, 21342211411533 is an apocalyptic number.
It is an amenable number.
1342211411533 is a deficient number, since it is larger than the sum of its proper divisors (1).
1342211411533 is an equidigital number, since it uses as much as digits as its factorization.
1342211411533 is an evil number, because the sum of its binary digits is even.
The product of its digits is 8640, while the sum is 31.
Adding to 1342211411533 its reverse (3351141122431), we get a palindrome (4693352533964).
The spelling of 1342211411533 in words is "one trillion, three hundred forty-two billion, two hundred eleven million, four hundred eleven thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •