Base | Representation |
---|---|
bin | 101101100001111001001010… |
… | …010101000100101001001111 |
3 | 222020222212120101011010012001 |
4 | 231201321022111010221033 |
5 | 202221223000322442033 |
6 | 1545513313142253131 |
7 | 60114643624200202 |
oct | 5541711225045117 |
9 | 866885511133161 |
10 | 200241212312143 |
11 | 58891904088652 |
12 | 1a560108a271a7 |
13 | 8796885875b72 |
14 | 3763a252c9939 |
15 | 1823b00668e7d |
hex | b61e4a544a4f |
200241212312143 has 32 divisors (see below), whose sum is σ = 210312365084672. Its totient is φ = 190410440774400.
The previous prime is 200241212312123. The next prime is 200241212312159. The reversal of 200241212312143 is 341213212142002.
It is a cyclic number.
It is not a de Polignac number, because 200241212312143 - 25 = 200241212312111 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 (200241212312123) 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 31 ways as a sum of consecutive naturals, for example, 10792919755 + ... + 10792938307.
It is an arithmetic number, because the mean of its divisors is an integer number (6572261408896).
Almost surely, 2200241212312143 is an apocalyptic number.
200241212312143 is a deficient number, since it is larger than the sum of its proper divisors (10071152772529).
200241212312143 is a wasteful number, since it uses less digits than its factorization.
200241212312143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31415.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 200241212312143 its reverse (341213212142002), we get a palindrome (541454424454145).
The spelling of 200241212312143 in words is "two hundred trillion, two hundred forty-one billion, two hundred twelve million, three hundred twelve thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •