Base | Representation |
---|---|
bin | 1000010001110110010… |
… | …1001010101101100001 |
3 | 111121010021012221102221 |
4 | 2010131211022231201 |
5 | 4312241413000413 |
6 | 145201210511041 |
7 | 13163411531356 |
oct | 2043545125541 |
9 | 447107187387 |
10 | 142230203233 |
11 | 55357272908 |
12 | 23694735481 |
13 | 10548939c91 |
14 | 6c538cc62d |
15 | 3a7690768d |
hex | 211d94ab61 |
142230203233 has 2 divisors, whose sum is σ = 142230203234. Its totient is φ = 142230203232.
The previous prime is 142230203209. The next prime is 142230203261. The reversal of 142230203233 is 332302032241.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 86681369889 + 55548833344 = 294417^2 + 235688^2 .
It is a cyclic number.
It is not a de Polignac number, because 142230203233 - 221 = 142228106081 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 142230203198 and 142230203207.
It is not a weakly prime, because it can be changed into another prime (142230207233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71115101616 + 71115101617.
It is an arithmetic number, because the mean of its divisors is an integer number (71115101617).
Almost surely, 2142230203233 is an apocalyptic number.
It is an amenable number.
142230203233 is a deficient number, since it is larger than the sum of its proper divisors (1).
142230203233 is an equidigital number, since it uses as much as digits as its factorization.
142230203233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 25.
Adding to 142230203233 its reverse (332302032241), we get a palindrome (474532235474).
The spelling of 142230203233 in words is "one hundred forty-two billion, two hundred thirty million, two hundred three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •