Base | Representation |
---|---|
bin | 101101100001010100101001… |
… | …001110010111011010100101 |
3 | 222020212010100202102001102212 |
4 | 231201110221032113122211 |
5 | 202220102200030401404 |
6 | 1545443310301413205 |
7 | 60112055150556131 |
oct | 5541245116273245 |
9 | 866763322361385 |
10 | 200202002200229 |
11 | 58877212a94187 |
12 | 1a5545a556a205 |
13 | 8792c77345a03 |
14 | 3761b859b43c1 |
15 | 1822aa81ad06e |
hex | b615293976a5 |
200202002200229 has 2 divisors, whose sum is σ = 200202002200230. Its totient is φ = 200202002200228.
The previous prime is 200202002200153. The next prime is 200202002200243. The reversal of 200202002200229 is 922002200202002.
It is a happy number.
200202002200229 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 173575091544100 + 26626910656129 = 13174790^2 + 5160127^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200202002200229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200202002200259) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100101001100114 + 100101001100115.
It is an arithmetic number, because the mean of its divisors is an integer number (100101001100115).
Almost surely, 2200202002200229 is an apocalyptic number.
It is an amenable number.
200202002200229 is a deficient number, since it is larger than the sum of its proper divisors (1).
200202002200229 is an equidigital number, since it uses as much as digits as its factorization.
200202002200229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 23.
The spelling of 200202002200229 in words is "two hundred trillion, two hundred two billion, two million, two hundred thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •