Base | Representation |
---|---|
bin | 1011101001111010110… |
… | …1001001111101010101 |
3 | 201010211110012110101101 |
4 | 2322132231021331111 |
5 | 11240033132224023 |
6 | 231552424030101 |
7 | 20315625356122 |
oct | 2723655117525 |
9 | 633743173341 |
10 | 200231133013 |
11 | 77a1028891a |
12 | 32981002331 |
13 | 15b60187082 |
14 | 9996a89749 |
15 | 531d8cd1ad |
hex | 2e9eb49f55 |
200231133013 has 4 divisors (see below), whose sum is σ = 203051289888. Its totient is φ = 197410976140.
The previous prime is 200231133007. The next prime is 200231133023. The reversal of 200231133013 is 310331132002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200231133013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200231133023) 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 in 3 ways as a sum of consecutive naturals, for example, 1410078331 + ... + 1410078472.
It is an arithmetic number, because the mean of its divisors is an integer number (50762822472).
Almost surely, 2200231133013 is an apocalyptic number.
It is an amenable number.
200231133013 is a deficient number, since it is larger than the sum of its proper divisors (2820156875).
200231133013 is an equidigital number, since it uses as much as digits as its factorization.
200231133013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2820156874.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 200231133013 its reverse (310331132002), we get a palindrome (510562265015).
The spelling of 200231133013 in words is "two hundred billion, two hundred thirty-one million, one hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •