Base | Representation |
---|---|
bin | 1011101001001001000… |
… | …1000001100111110001 |
3 | 201010021220111100202011 |
4 | 2322102101001213301 |
5 | 11234121220312431 |
6 | 231520010522521 |
7 | 20310512423062 |
oct | 2722221014761 |
9 | 633256440664 |
10 | 200022432241 |
11 | 779134a2945 |
12 | 32923136441 |
13 | 15b28b746a8 |
14 | 9977080569 |
15 | 530a405cb1 |
hex | 2e924419f1 |
200022432241 has 2 divisors, whose sum is σ = 200022432242. Its totient is φ = 200022432240.
The previous prime is 200022432209. The next prime is 200022432263. The reversal of 200022432241 is 142234220002.
It is an a-pointer prime, because the next prime (200022432263) can be obtained adding 200022432241 to its sum of digits (22).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 111022240000 + 89000192241 = 333200^2 + 298329^2 .
It is a cyclic number.
It is not a de Polignac number, because 200022432241 - 25 = 200022432209 is a prime.
It is not a weakly prime, because it can be changed into another prime (200022432041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100011216120 + 100011216121.
It is an arithmetic number, because the mean of its divisors is an integer number (100011216121).
Almost surely, 2200022432241 is an apocalyptic number.
It is an amenable number.
200022432241 is a deficient number, since it is larger than the sum of its proper divisors (1).
200022432241 is an equidigital number, since it uses as much as digits as its factorization.
200022432241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536, while the sum is 22.
Adding to 200022432241 its reverse (142234220002), we get a palindrome (342256652243).
The spelling of 200022432241 in words is "two hundred billion, twenty-two million, four hundred thirty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •