Base | Representation |
---|---|
bin | 101101011110100001110101… |
… | …101110101011101111111101 |
3 | 222020011202210122101010201021 |
4 | 231132201311232223233331 |
5 | 202203431001111242341 |
6 | 1545215155305544141 |
7 | 60062150361601561 |
oct | 5536416556535775 |
9 | 866152718333637 |
10 | 200010012212221 |
11 | 58802851709602 |
12 | 1a5233444a5051 |
13 | 877ab2b663b03 |
14 | 37567716456a1 |
15 | 181cabd0609d1 |
hex | b5e875babbfd |
200010012212221 has 32 divisors (see below), whose sum is σ = 214026385010688. Its totient is φ = 186252395535360.
The previous prime is 200010012212189. The next prime is 200010012212261. The reversal of 200010012212221 is 122212210010002.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 200010012212221 - 25 = 200010012212189 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200010012212195 and 200010012212204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200010012212261) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1540215331 + ... + 1540345183.
It is an arithmetic number, because the mean of its divisors is an integer number (6688324531584).
Almost surely, 2200010012212221 is an apocalyptic number.
It is an amenable number.
200010012212221 is a deficient number, since it is larger than the sum of its proper divisors (14016372798467).
200010012212221 is a wasteful number, since it uses less digits than its factorization.
200010012212221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131941.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 200010012212221 its reverse (122212210010002), we get a palindrome (322222222222223).
The spelling of 200010012212221 in words is "two hundred trillion, ten billion, twelve million, two hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •