Base | Representation |
---|---|
bin | 10000110101010… |
… | …01011100001101 |
3 | 100211200212101122 |
4 | 20122221130031 |
5 | 242122000323 |
6 | 22002250325 |
7 | 3333131114 |
oct | 1032513415 |
9 | 324625348 |
10 | 141203213 |
11 | 72784078 |
12 | 3b3569a5 |
13 | 2333bbc8 |
14 | 14a78c7b |
15 | c5e2ec8 |
hex | 86a970d |
141203213 has 2 divisors, whose sum is σ = 141203214. Its totient is φ = 141203212.
The previous prime is 141203203. The next prime is 141203261. The reversal of 141203213 is 312302141.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 129458884 + 11744329 = 11378^2 + 3427^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-141203213 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 141203191 and 141203200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141203203) 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, 70601606 + 70601607.
It is an arithmetic number, because the mean of its divisors is an integer number (70601607).
Almost surely, 2141203213 is an apocalyptic number.
It is an amenable number.
141203213 is a deficient number, since it is larger than the sum of its proper divisors (1).
141203213 is an equidigital number, since it uses as much as digits as its factorization.
141203213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 141203213 is about 11882.8958170978. The cubic root of 141203213 is about 520.7327109181.
Adding to 141203213 its reverse (312302141), we get a palindrome (453505354).
The spelling of 141203213 in words is "one hundred forty-one million, two hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •