Base | Representation |
---|---|
bin | 101111110010110110001001… |
… | …101011011110111101100111 |
3 | 1000120021010220000010010112100 |
4 | 233302312021223132331213 |
5 | 210022423304400424033 |
6 | 2023021334442023143 |
7 | 62163421025154324 |
oct | 5762661153367547 |
9 | 1016233800103470 |
10 | 210202304311143 |
11 | 60a82329903641 |
12 | 1b6aa7464a7ab3 |
13 | 9039cb8c5aa91 |
14 | 39c9bbaca5b4b |
15 | 1947c9e8ca513 |
hex | bf2d89adef67 |
210202304311143 has 12 divisors (see below), whose sum is σ = 303626421661888. Its totient is φ = 140134467545280.
The previous prime is 210202304311133. The next prime is 210202304311151. The reversal of 210202304311143 is 341113403202012.
210202304311143 is a `hidden beast` number, since 2 + 1 + 0 + 2 + 0 + 2 + 304 + 311 + 1 + 43 = 666.
It is not a de Polignac number, because 210202304311143 - 216 = 210202304245607 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210202304311133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 30170530 + ... + 36478287.
Almost surely, 2210202304311143 is an apocalyptic number.
210202304311143 is a deficient number, since it is larger than the sum of its proper divisors (93424117350745).
210202304311143 is a wasteful number, since it uses less digits than its factorization.
210202304311143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66999254 (or 66999251 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 210202304311143 its reverse (341113403202012), we get a palindrome (551315707513155).
The spelling of 210202304311143 in words is "two hundred ten trillion, two hundred two billion, three hundred four million, three hundred eleven thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •