Base | Representation |
---|---|
bin | 101111110011001001011101… |
… | …000010100001001001000111 |
3 | 1000120100010101102112221101021 |
4 | 233303021131002201021013 |
5 | 210023243231213224033 |
6 | 2023035043222012011 |
7 | 62165053443333625 |
oct | 5763113502411107 |
9 | 1016303342487337 |
10 | 210223030211143 |
11 | 60a900a5062014 |
12 | 1b6b276b577007 |
13 | 903bc3cb42831 |
14 | 39cabc5748515 |
15 | 19485b4232b2d |
hex | bf325d0a1247 |
210223030211143 has 2 divisors, whose sum is σ = 210223030211144. Its totient is φ = 210223030211142.
The previous prime is 210223030211123. The next prime is 210223030211167. The reversal of 210223030211143 is 341112030322012.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 210223030211143 - 217 = 210223030080071 is a prime.
It is a super-2 number, since 2×2102230302111432 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210223030211123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105111515105571 + 105111515105572.
It is an arithmetic number, because the mean of its divisors is an integer number (105111515105572).
Almost surely, 2210223030211143 is an apocalyptic number.
210223030211143 is a deficient number, since it is larger than the sum of its proper divisors (1).
210223030211143 is an equidigital number, since it uses as much as digits as its factorization.
210223030211143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 210223030211143 its reverse (341112030322012), we get a palindrome (551335060533155).
The spelling of 210223030211143 in words is "two hundred ten trillion, two hundred twenty-three billion, thirty million, two hundred eleven thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •