Base | Representation |
---|---|
bin | 101101100000000001001000… |
… | …100010010001111101100011 |
3 | 222020112112220120100221100122 |
4 | 231200001020202101331203 |
5 | 202212120024244420001 |
6 | 1545334200423510455 |
7 | 60102432110630132 |
oct | 5540011042217543 |
9 | 866475816327318 |
10 | 200112333201251 |
11 | 588421891a1059 |
12 | 1a53b13b5b842b |
13 | 8787686c87033 |
14 | 375b6baa39919 |
15 | 18205aae15b1b |
hex | b60048891f63 |
200112333201251 has 2 divisors, whose sum is σ = 200112333201252. Its totient is φ = 200112333201250.
The previous prime is 200112333201191. The next prime is 200112333201329. The reversal of 200112333201251 is 152102333211002.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200112333201251 - 230 = 200111259459427 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200112333201251.
It is not a weakly prime, because it can be changed into another prime (200112333206251) 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, 100056166600625 + 100056166600626.
It is an arithmetic number, because the mean of its divisors is an integer number (100056166600626).
Almost surely, 2200112333201251 is an apocalyptic number.
200112333201251 is a deficient number, since it is larger than the sum of its proper divisors (1).
200112333201251 is an equidigital number, since it uses as much as digits as its factorization.
200112333201251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 200112333201251 its reverse (152102333211002), we get a palindrome (352214666412253).
The spelling of 200112333201251 in words is "two hundred trillion, one hundred twelve billion, three hundred thirty-three million, two hundred one thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •