Base | Representation |
---|---|
bin | 101101100000000000110100… |
… | …101011010000101110010001 |
3 | 222020112112001100102010110122 |
4 | 231200000310223100232101 |
5 | 202212113334000324103 |
6 | 1545334103402240025 |
7 | 60102420623564336 |
oct | 5540006453205621 |
9 | 866475040363418 |
10 | 200112000011153 |
11 | 5884202810843a |
12 | 1a53b067ab6015 |
13 | 8787632c38229 |
14 | 375b6886a698d |
15 | 182058ba4cb38 |
hex | b60034ad0b91 |
200112000011153 has 2 divisors, whose sum is σ = 200112000011154. Its totient is φ = 200112000011152.
The previous prime is 200112000011111. The next prime is 200112000011221. The reversal of 200112000011153 is 351110000211002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 116944585784464 + 83167414226689 = 10814092^2 + 9119617^2 .
It is a cyclic number.
It is not a de Polignac number, because 200112000011153 - 26 = 200112000011089 is a prime.
It is not a weakly prime, because it can be changed into another prime (200112000011453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100056000005576 + 100056000005577.
It is an arithmetic number, because the mean of its divisors is an integer number (100056000005577).
Almost surely, 2200112000011153 is an apocalyptic number.
It is an amenable number.
200112000011153 is a deficient number, since it is larger than the sum of its proper divisors (1).
200112000011153 is an equidigital number, since it uses as much as digits as its factorization.
200112000011153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60, while the sum is 17.
Adding to 200112000011153 its reverse (351110000211002), we get a palindrome (551222000222155).
The spelling of 200112000011153 in words is "two hundred trillion, one hundred twelve billion, eleven thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •