Base | Representation |
---|---|
bin | 1011101001111011000… |
… | …1101110111101000001 |
3 | 201010211112110102121211 |
4 | 2322132301232331001 |
5 | 11240033434124441 |
6 | 231552505450121 |
7 | 20315641515022 |
oct | 2723661567501 |
9 | 633745412554 |
10 | 200232333121 |
11 | 77a10a28547 |
12 | 329814a0941 |
13 | 15b604b73b2 |
14 | 9996cbcc49 |
15 | 531da68a81 |
hex | 2e9ec6ef41 |
200232333121 has 2 divisors, whose sum is σ = 200232333122. Its totient is φ = 200232333120.
The previous prime is 200232333109. The next prime is 200232333137. The reversal of 200232333121 is 121333232002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 190532250000 + 9700083121 = 436500^2 + 98489^2 .
It is a cyclic number.
It is not a de Polignac number, because 200232333121 - 29 = 200232332609 is a prime.
It is a super-2 number, since 2×2002323331212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200232333092 and 200232333101.
It is not a weakly prime, because it can be changed into another prime (200235333121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100116166560 + 100116166561.
It is an arithmetic number, because the mean of its divisors is an integer number (100116166561).
Almost surely, 2200232333121 is an apocalyptic number.
It is an amenable number.
200232333121 is a deficient number, since it is larger than the sum of its proper divisors (1).
200232333121 is an equidigital number, since it uses as much as digits as its factorization.
200232333121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 200232333121 its reverse (121333232002), we get a palindrome (321565565123).
The spelling of 200232333121 in words is "two hundred billion, two hundred thirty-two million, three hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •