Base | Representation |
---|---|
bin | 101101100001011101111101… |
… | …101111111100001000101001 |
3 | 222020220002012020021020112100 |
4 | 231201131331233330020221 |
5 | 202220233144104101441 |
6 | 1545452043332204013 |
7 | 60112561153421412 |
oct | 5541357557741051 |
9 | 866802166236470 |
10 | 200212010222121 |
11 | 58880489288157 |
12 | 1a556519169609 |
13 | 8793bb08b1561 |
14 | 3762454c24809 |
15 | 1822e91b02cb6 |
hex | b6177dbfc229 |
200212010222121 has 12 divisors (see below), whose sum is σ = 289195586728048. Its totient is φ = 133474460780664.
The previous prime is 200212010222117. The next prime is 200212010222129. The reversal of 200212010222121 is 121222010212002.
It is a happy number.
200212010222121 is a `hidden beast` number, since 200 + 2 + 120 + 1 + 0 + 222 + 121 = 666.
It is not a de Polignac number, because 200212010222121 - 22 = 200212010222117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200212010222094 and 200212010222103.
It is not an unprimeable number, because it can be changed into a prime (200212010222129) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11654155 + ... + 23156928.
Almost surely, 2200212010222121 is an apocalyptic number.
It is an amenable number.
200212010222121 is a deficient number, since it is larger than the sum of its proper divisors (88983576505927).
200212010222121 is a wasteful number, since it uses less digits than its factorization.
200212010222121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35450132 (or 35450129 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 200212010222121 its reverse (121222010212002), we get a palindrome (321434020434123).
The spelling of 200212010222121 in words is "two hundred trillion, two hundred twelve billion, ten million, two hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •