Base | Representation |
---|---|
bin | 101101011110100010000111… |
… | …000100110000111001000001 |
3 | 222020011210112220221111220101 |
4 | 231132202013010300321001 |
5 | 202203432100110304441 |
6 | 1545215244223042401 |
7 | 60062160524220652 |
oct | 5536420704607101 |
9 | 866153486844811 |
10 | 200010303213121 |
11 | 588029909a6915 |
12 | 1a523405a40401 |
13 | 877ab76a307ab |
14 | 375679c155529 |
15 | 181cad8893231 |
hex | b5e887130e41 |
200010303213121 has 16 divisors (see below), whose sum is σ = 219079535887440. Its totient is φ = 181752695111680.
The previous prime is 200010303213107. The next prime is 200010303213167. The reversal of 200010303213121 is 121312303010002.
It can be written as a sum of positive squares in 8 ways, for example, as 1448385773121 + 198561917440000 = 1203489^2 + 14091200^2 .
It is a cyclic number.
It is not a de Polignac number, because 200010303213121 - 29 = 200010303212609 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200010303213221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 87693435 + ... + 89945311.
It is an arithmetic number, because the mean of its divisors is an integer number (13692470992965).
Almost surely, 2200010303213121 is an apocalyptic number.
It is an amenable number.
200010303213121 is a deficient number, since it is larger than the sum of its proper divisors (19069232674319).
200010303213121 is a wasteful number, since it uses less digits than its factorization.
200010303213121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2432084.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 200010303213121 its reverse (121312303010002), we get a palindrome (321322606223123).
The spelling of 200010303213121 in words is "two hundred trillion, ten billion, three hundred three million, two hundred thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •