Base | Representation |
---|---|
bin | 101101011110011010011010… |
… | …110000001110111110010001 |
3 | 222020011000020021201121200221 |
4 | 231132122122300032332101 |
5 | 202203313141110103131 |
6 | 1545211400443313041 |
7 | 60061446040265542 |
oct | 5536323260167621 |
9 | 866130207647627 |
10 | 200002043441041 |
11 | 587aa4325308a6 |
12 | 1a52189b81b781 |
13 | 877a15b7360aa |
14 | 375621718a4c9 |
15 | 181c7a3683411 |
hex | b5e69ac0ef91 |
200002043441041 has 2 divisors, whose sum is σ = 200002043441042. Its totient is φ = 200002043441040.
The previous prime is 200002043441029. The next prime is 200002043441059. The reversal of 200002043441041 is 140144340200002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 169689806462016 + 30312236979025 = 13026504^2 + 5505655^2 .
It is a cyclic number.
It is not a de Polignac number, because 200002043441041 - 245 = 164817671352209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200002043440997 and 200002043441015.
It is not a weakly prime, because it can be changed into another prime (200002043448041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100001021720520 + 100001021720521.
It is an arithmetic number, because the mean of its divisors is an integer number (100001021720521).
Almost surely, 2200002043441041 is an apocalyptic number.
It is an amenable number.
200002043441041 is a deficient number, since it is larger than the sum of its proper divisors (1).
200002043441041 is an equidigital number, since it uses as much as digits as its factorization.
200002043441041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 200002043441041 its reverse (140144340200002), we get a palindrome (340146383641043).
The spelling of 200002043441041 in words is "two hundred trillion, two billion, forty-three million, four hundred forty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •