Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …101010101000111111001100 |
3 | 222020212222120222111102011011 |
4 | 231201131001222220333030 |
5 | 202220224113030400022 |
6 | 1545451355322535004 |
7 | 60112524163366426 |
oct | 5541350152507714 |
9 | 866788528442134 |
10 | 200211002200012 |
11 | 58880011285231 |
12 | 1a556297667464 |
13 | 8793a7cac5b7b |
14 | 376239adc9816 |
15 | 1822e33389977 |
hex | b61741aa8fcc |
200211002200012 has 24 divisors (see below), whose sum is σ = 350756452247040. Its totient is φ = 99994876684560.
The previous prime is 200211002199953. The next prime is 200211002200019. The reversal of 200211002200012 is 210002200112002.
It is a happy number.
200211002200012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 200211002199965 and 200211002200001.
It is not an unprimeable number, because it can be changed into a prime (200211002200019) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 232301103 + ... + 233161369.
It is an arithmetic number, because the mean of its divisors is an integer number (14614852176960).
Almost surely, 2200211002200012 is an apocalyptic number.
It is an amenable number.
200211002200012 is a deficient number, since it is larger than the sum of its proper divisors (150545450047028).
200211002200012 is a wasteful number, since it uses less digits than its factorization.
200211002200012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 924501 (or 924499 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 200211002200012 its reverse (210002200112002), we get a palindrome (410213202312014).
The spelling of 200211002200012 in words is "two hundred trillion, two hundred eleven billion, two million, two hundred thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •