Base | Representation |
---|---|
bin | 101101100001010100101111… |
… | …000111010011011001000001 |
3 | 222020212010121122100012202022 |
4 | 231201110233013103121001 |
5 | 202220102400324341113 |
6 | 1545443324151331225 |
7 | 60112060460502161 |
oct | 5541245707233101 |
9 | 866763548305668 |
10 | 200202101012033 |
11 | 58877263843a2a |
12 | 1a554612680b15 |
13 | 8792c91961733 |
14 | 3761b94b765a1 |
15 | 1822ab1bca908 |
hex | b6152f1d3641 |
200202101012033 has 2 divisors, whose sum is σ = 200202101012034. Its totient is φ = 200202101012032.
The previous prime is 200202101011987. The next prime is 200202101012071. The reversal of 200202101012033 is 330210101202002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 196495829183809 + 3706271828224 = 14017697^2 + 1925168^2 .
It is a cyclic number.
It is not a de Polignac number, because 200202101012033 - 226 = 200202033903169 is a prime.
It is not a weakly prime, because it can be changed into another prime (200202101012083) 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 as a sum of consecutive naturals, namely, 100101050506016 + 100101050506017.
It is an arithmetic number, because the mean of its divisors is an integer number (100101050506017).
Almost surely, 2200202101012033 is an apocalyptic number.
It is an amenable number.
200202101012033 is a deficient number, since it is larger than the sum of its proper divisors (1).
200202101012033 is an equidigital number, since it uses as much as digits as its factorization.
200202101012033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 200202101012033 its reverse (330210101202002), we get a palindrome (530412202214035).
The spelling of 200202101012033 in words is "two hundred trillion, two hundred two billion, one hundred one million, twelve thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •