Base | Representation |
---|---|
bin | 11110010010010110010101… |
… | …001101001000111010011011 |
3 | 122110122000110222120200221122 |
4 | 132102112111031020322123 |
5 | 114424341324421003121 |
6 | 1151144145230555455 |
7 | 40025356522454141 |
oct | 3622262515107233 |
9 | 573560428520848 |
10 | 133202324000411 |
11 | 39495874358aa6 |
12 | 12b33604968b8b |
13 | 5942c04a30613 |
14 | 24c7053a91591 |
15 | 105ed712c45ab |
hex | 792595348e9b |
133202324000411 has 2 divisors, whose sum is σ = 133202324000412. Its totient is φ = 133202324000410.
The previous prime is 133202324000399. The next prime is 133202324000453. The reversal of 133202324000411 is 114000423202331.
It is a weak prime.
It is an emirp because it is prime and its reverse (114000423202331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133202324000411 - 210 = 133202323999387 is a prime.
It is a super-2 number, since 2×1332023240004112 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (133202324000111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66601162000205 + 66601162000206.
It is an arithmetic number, because the mean of its divisors is an integer number (66601162000206).
Almost surely, 2133202324000411 is an apocalyptic number.
133202324000411 is a deficient number, since it is larger than the sum of its proper divisors (1).
133202324000411 is an equidigital number, since it uses as much as digits as its factorization.
133202324000411 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 133202324000411 its reverse (114000423202331), we get a palindrome (247202747202742).
The spelling of 133202324000411 in words is "one hundred thirty-three trillion, two hundred two billion, three hundred twenty-four million, four hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •