Base | Representation |
---|---|
bin | 1000010101100100110… |
… | …0000001010011000001 |
3 | 111200200221222021112002 |
4 | 2011121030001103001 |
5 | 4321313420302113 |
6 | 145444333113345 |
7 | 13230243662252 |
oct | 2053114012301 |
9 | 450627867462 |
10 | 143230244033 |
11 | 5581a814308 |
12 | 23913628855 |
13 | 10677b8c8b6 |
14 | 6d0a64ab29 |
15 | 3ad45e5c58 |
hex | 21593014c1 |
143230244033 has 2 divisors, whose sum is σ = 143230244034. Its totient is φ = 143230244032.
The previous prime is 143230244029. The next prime is 143230244071. The reversal of 143230244033 is 330442032341.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 120164835904 + 23065408129 = 346648^2 + 151873^2 .
It is a cyclic number.
It is not a de Polignac number, because 143230244033 - 22 = 143230244029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 143230243987 and 143230244005.
It is not a weakly prime, because it can be changed into another prime (143230214033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71615122016 + 71615122017.
It is an arithmetic number, because the mean of its divisors is an integer number (71615122017).
Almost surely, 2143230244033 is an apocalyptic number.
It is an amenable number.
143230244033 is a deficient number, since it is larger than the sum of its proper divisors (1).
143230244033 is an equidigital number, since it uses as much as digits as its factorization.
143230244033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 29.
Adding to 143230244033 its reverse (330442032341), we get a palindrome (473672276374).
The spelling of 143230244033 in words is "one hundred forty-three billion, two hundred thirty million, two hundred forty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •