Base | Representation |
---|---|
bin | 101101011110100011000011… |
… | …110000001100001011011011 |
3 | 222020011220011212112010120211 |
4 | 231132203003300030023123 |
5 | 202203441141213330133 |
6 | 1545215533230431551 |
7 | 60062224665221221 |
oct | 5536430360141333 |
9 | 866156155463524 |
10 | 200011321230043 |
11 | 58803363606014 |
12 | 1a52364a9625b7 |
13 | 877aca990857b |
14 | 3756857432b11 |
15 | 181cb47e32bcd |
hex | b5e8c3c0c2db |
200011321230043 has 2 divisors, whose sum is σ = 200011321230044. Its totient is φ = 200011321230042.
The previous prime is 200011321230029. The next prime is 200011321230059. The reversal of 200011321230043 is 340032123110002.
200011321230043 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200011321230043 - 217 = 200011321098971 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200011321229996 and 200011321230023.
It is not a weakly prime, because it can be changed into another prime (200011321230023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100005660615021 + 100005660615022.
It is an arithmetic number, because the mean of its divisors is an integer number (100005660615022).
Almost surely, 2200011321230043 is an apocalyptic number.
200011321230043 is a deficient number, since it is larger than the sum of its proper divisors (1).
200011321230043 is an equidigital number, since it uses as much as digits as its factorization.
200011321230043 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 200011321230043 its reverse (340032123110002), we get a palindrome (540043444340045).
The spelling of 200011321230043 in words is "two hundred trillion, eleven billion, three hundred twenty-one million, two hundred thirty thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •