Base | Representation |
---|---|
bin | 1011101001000110011… |
… | …0010000100000010101 |
3 | 201010021010101202211111 |
4 | 2322101212100200111 |
5 | 11234110333033023 |
6 | 231514530335021 |
7 | 20310315220222 |
oct | 2722146204025 |
9 | 633233352744 |
10 | 200011221013 |
11 | 7790813576a |
12 | 3291b42a471 |
13 | 15b2674a726 |
14 | 99757a2949 |
15 | 530943e00d |
hex | 2e91990815 |
200011221013 has 2 divisors, whose sum is σ = 200011221014. Its totient is φ = 200011221012.
The previous prime is 200011220993. The next prime is 200011221023. The reversal of 200011221013 is 310122110002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 164168401329 + 35842819684 = 405177^2 + 189322^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200011221013 is a prime.
It is a super-2 number, since 2×2000112210132 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200011220984 and 200011221002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200011221023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100005610506 + 100005610507.
It is an arithmetic number, because the mean of its divisors is an integer number (100005610507).
Almost surely, 2200011221013 is an apocalyptic number.
It is an amenable number.
200011221013 is a deficient number, since it is larger than the sum of its proper divisors (1).
200011221013 is an equidigital number, since it uses as much as digits as its factorization.
200011221013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 200011221013 its reverse (310122110002), we get a palindrome (510133331015).
The spelling of 200011221013 in words is "two hundred billion, eleven million, two hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •