Base | Representation |
---|---|
bin | 101101100011001101110100… |
… | …110111010000100101011001 |
3 | 222021022120012220102211210022 |
4 | 231203031310313100211121 |
5 | 202224220140234331413 |
6 | 1550023145554400225 |
7 | 60124342456561235 |
oct | 5543156467204531 |
9 | 867276186384708 |
10 | 200332120230233 |
11 | 58917414249a72 |
12 | 1a575859890075 |
13 | 87a2312804884 |
14 | 37681aaa055c5 |
15 | 1826171588608 |
hex | b63374dd0959 |
200332120230233 has 2 divisors, whose sum is σ = 200332120230234. Its totient is φ = 200332120230232.
The previous prime is 200332120230217. The next prime is 200332120230251. The reversal of 200332120230233 is 332032021233002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 177638063016649 + 22694057213584 = 13328093^2 + 4763828^2 .
It is a cyclic number.
It is not a de Polignac number, because 200332120230233 - 24 = 200332120230217 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (200332120230733) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100166060115116 + 100166060115117.
It is an arithmetic number, because the mean of its divisors is an integer number (100166060115117).
Almost surely, 2200332120230233 is an apocalyptic number.
It is an amenable number.
200332120230233 is a deficient number, since it is larger than the sum of its proper divisors (1).
200332120230233 is an equidigital number, since it uses as much as digits as its factorization.
200332120230233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 26.
Adding to 200332120230233 its reverse (332032021233002), we get a palindrome (532364141463235).
The spelling of 200332120230233 in words is "two hundred trillion, three hundred thirty-two billion, one hundred twenty million, two hundred thirty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •