Base | Representation |
---|---|
bin | 1011101010010010111… |
… | …0000001010101001001 |
3 | 201011002111001012120202 |
4 | 2322210232001111021 |
5 | 11240234444214423 |
6 | 232010430301545 |
7 | 20321262046265 |
oct | 2724456012511 |
9 | 634074035522 |
10 | 200332023113 |
11 | 77a62228072 |
12 | 329aa9578b5 |
13 | 15b7804ca61 |
14 | 99a622d0a5 |
15 | 53276ab728 |
hex | 2ea4b81549 |
200332023113 has 4 divisors (see below), whose sum is σ = 207240023940. Its totient is φ = 193424022288.
The previous prime is 200332023107. The next prime is 200332023163. The reversal of 200332023113 is 311320233002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 171108804409 + 29223218704 = 413653^2 + 170948^2 .
It is not a de Polignac number, because 200332023113 - 26 = 200332023049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200332023163) 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 in 3 ways as a sum of consecutive naturals, for example, 3454000370 + ... + 3454000427.
It is an arithmetic number, because the mean of its divisors is an integer number (51810005985).
Almost surely, 2200332023113 is an apocalyptic number.
It is an amenable number.
200332023113 is a deficient number, since it is larger than the sum of its proper divisors (6908000827).
200332023113 is an equidigital number, since it uses as much as digits as its factorization.
200332023113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6908000826.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 200332023113 its reverse (311320233002), we get a palindrome (511652256115).
The spelling of 200332023113 in words is "two hundred billion, three hundred thirty-two million, twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •