Base | Representation |
---|---|
bin | 1011101001110011101… |
… | …1011110010100101101 |
3 | 201010202101010102002122 |
4 | 2322130323132110231 |
5 | 11240003020111023 |
6 | 231545441202325 |
7 | 20315114146544 |
oct | 2723473362455 |
9 | 633671112078 |
10 | 200201332013 |
11 | 779a54839a1 |
12 | 329730303a5 |
13 | 15b56c51847 |
14 | 9992b2d15b |
15 | 531ae932c8 |
hex | 2e9cede52d |
200201332013 has 2 divisors, whose sum is σ = 200201332014. Its totient is φ = 200201332012.
The previous prime is 200201331949. The next prime is 200201332027. The reversal of 200201332013 is 310233102002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104043663364 + 96157668649 = 322558^2 + 310093^2 .
It is a cyclic number.
It is not a de Polignac number, because 200201332013 - 26 = 200201331949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200201331982 and 200201332000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200201332213) 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, 100100666006 + 100100666007.
It is an arithmetic number, because the mean of its divisors is an integer number (100100666007).
Almost surely, 2200201332013 is an apocalyptic number.
It is an amenable number.
200201332013 is a deficient number, since it is larger than the sum of its proper divisors (1).
200201332013 is an equidigital number, since it uses as much as digits as its factorization.
200201332013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 200201332013 its reverse (310233102002), we get a palindrome (510434434015).
The spelling of 200201332013 in words is "two hundred billion, two hundred one million, three hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •