Base | Representation |
---|---|
bin | 101101100100010110100100… |
… | …001110011010100110010011 |
3 | 222021121000211002220200120102 |
4 | 231210112210032122212103 |
5 | 202232010114401203133 |
6 | 1550123104102403015 |
7 | 60133106116656455 |
oct | 5544264416324623 |
9 | 867530732820512 |
10 | 200410224241043 |
11 | 5894755399a333 |
12 | 1a588a1673046b |
13 | 87a97abbab59b |
14 | 376bc99a3c2d5 |
15 | 18281e338c7e8 |
hex | b645a439a993 |
200410224241043 has 2 divisors, whose sum is σ = 200410224241044. Its totient is φ = 200410224241042.
The previous prime is 200410224241033. The next prime is 200410224241049. The reversal of 200410224241043 is 340142422014002.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200410224241043 - 24 = 200410224241027 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200410224240997 and 200410224241015.
It is not a weakly prime, because it can be changed into another prime (200410224241049) 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 as a sum of consecutive naturals, namely, 100205112120521 + 100205112120522.
It is an arithmetic number, because the mean of its divisors is an integer number (100205112120522).
Almost surely, 2200410224241043 is an apocalyptic number.
200410224241043 is a deficient number, since it is larger than the sum of its proper divisors (1).
200410224241043 is an equidigital number, since it uses as much as digits as its factorization.
200410224241043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12288, while the sum is 29.
Adding to 200410224241043 its reverse (340142422014002), we get a palindrome (540552646255045).
The spelling of 200410224241043 in words is "two hundred trillion, four hundred ten billion, two hundred twenty-four million, two hundred forty-one thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •