Base | Representation |
---|---|
bin | 101111110010110111110000… |
… | …100010101000010000000111 |
3 | 1000120021022100021101101210100 |
4 | 233302313300202220100013 |
5 | 210022440323142340033 |
6 | 2023022222010255143 |
7 | 62163511551511053 |
oct | 5762676042502007 |
9 | 1016238307341710 |
10 | 210204030043143 |
11 | 60a83034a51634 |
12 | 1b6aab484274b3 |
13 | 903a202646786 |
14 | 39c9d02168c63 |
15 | 1947d51163513 |
hex | bf2df08a8407 |
210204030043143 has 12 divisors (see below), whose sum is σ = 304292437369648. Its totient is φ = 139829376656160.
The previous prime is 210204030043109. The next prime is 210204030043169. The reversal of 210204030043143 is 341340030402012.
210204030043143 is a `hidden beast` number, since 2 + 1 + 0 + 2 + 0 + 40 + 300 + 4 + 314 + 3 = 666.
It is not a de Polignac number, because 210204030043143 - 214 = 210204030026759 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 (210204030043043) 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 in 11 ways as a sum of consecutive naturals, for example, 25553610043 + ... + 25553618268.
Almost surely, 2210204030043143 is an apocalyptic number.
210204030043143 is a deficient number, since it is larger than the sum of its proper divisors (94088407326505).
210204030043143 is a wasteful number, since it uses less digits than its factorization.
210204030043143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51107228774 (or 51107228771 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 210204030043143 its reverse (341340030402012), we get a palindrome (551544060445155).
The spelling of 210204030043143 in words is "two hundred ten trillion, two hundred four billion, thirty million, forty-three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •