Base | Representation |
---|---|
bin | 1000010101001101100… |
… | …1110101111010011001 |
3 | 111200110012101010210021 |
4 | 2011103121311322121 |
5 | 4321114100012441 |
6 | 145430545150441 |
7 | 13224655106125 |
oct | 2052331657231 |
9 | 450405333707 |
10 | 143133204121 |
11 | 5577aa64836 |
12 | 238a702b421 |
13 | 10660a4452b |
14 | 6cdb7ca585 |
15 | 3acad283d1 |
hex | 2153675e99 |
143133204121 has 2 divisors, whose sum is σ = 143133204122. Its totient is φ = 143133204120.
The previous prime is 143133204047. The next prime is 143133204139. The reversal of 143133204121 is 121402331341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99426702400 + 43706501721 = 315320^2 + 209061^2 .
It is an emirp because it is prime and its reverse (121402331341) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 143133204121 - 211 = 143133202073 is a prime.
It is a super-2 number, since 2×1431332041212 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (143133204421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71566602060 + 71566602061.
It is an arithmetic number, because the mean of its divisors is an integer number (71566602061).
Almost surely, 2143133204121 is an apocalyptic number.
It is an amenable number.
143133204121 is a deficient number, since it is larger than the sum of its proper divisors (1).
143133204121 is an equidigital number, since it uses as much as digits as its factorization.
143133204121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 143133204121 its reverse (121402331341), we get a palindrome (264535535462).
The spelling of 143133204121 in words is "one hundred forty-three billion, one hundred thirty-three million, two hundred four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •