Base | Representation |
---|---|
bin | 101101100001010010111110… |
… | …011010000011010001011111 |
3 | 222020211221201212020222221001 |
4 | 231201102332122003101133 |
5 | 202220040012241220333 |
6 | 1545442412402451131 |
7 | 60111662560150054 |
oct | 5541227632032137 |
9 | 866757655228831 |
10 | 200200210101343 |
11 | 58876483436821 |
12 | 1a554185363aa7 |
13 | 8792a4cc9107a |
14 | 3761a5599702b |
15 | 1822a00bb5b7d |
hex | b614be68345f |
200200210101343 has 32 divisors (see below), whose sum is σ = 204706265997312. Its totient is φ = 195746593442400.
The previous prime is 200200210101341. The next prime is 200200210101401. The reversal of 200200210101343 is 343101012002002.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 200200210101343 - 21 = 200200210101341 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 200200210101343.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200200210101341) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14627026846 + ... + 14627040532.
It is an arithmetic number, because the mean of its divisors is an integer number (6397070812416).
Almost surely, 2200200210101343 is an apocalyptic number.
200200210101343 is a deficient number, since it is larger than the sum of its proper divisors (4506055895969).
200200210101343 is a wasteful number, since it uses less digits than its factorization.
200200210101343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16555.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 200200210101343 its reverse (343101012002002), we get a palindrome (543301222103345).
The spelling of 200200210101343 in words is "two hundred trillion, two hundred billion, two hundred ten million, one hundred one thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •