Base | Representation |
---|---|
bin | 101101100001011100010001… |
… | …111110001010100101101100 |
3 | 222020212220112012210122120120 |
4 | 231201130101332022211230 |
5 | 202220220443203341022 |
6 | 1545451144100044540 |
7 | 60112465306041003 |
oct | 5541342176124554 |
9 | 866786465718516 |
10 | 200210202012012 |
11 | 5887a740626135 |
12 | 1a5560b3693750 |
13 | 87939830a854a |
14 | 3762322a11c3a |
15 | 1822dd7ec6d5c |
hex | b61711f8a96c |
200210202012012 has 24 divisors (see below), whose sum is σ = 467171448285696. Its totient is φ = 66734689681488.
The previous prime is 200210202011987. The next prime is 200210202012103. The reversal of 200210202012012 is 210210202012002.
200210202012012 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 = 200210202011982 and 200210202012000.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 255132228 + ... + 255915755.
It is an arithmetic number, because the mean of its divisors is an integer number (19465477011904).
Almost surely, 2200210202012012 is an apocalyptic number.
It is an amenable number.
200210202012012 is an abundant number, since it is smaller than the sum of its proper divisors (266961246273684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200210202012012 is a wasteful number, since it uses less digits than its factorization.
200210202012012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 511080637 (or 511080635 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 200210202012012 its reverse (210210202012002), we get a palindrome (410420404024014).
The spelling of 200210202012012 in words is "two hundred trillion, two hundred ten billion, two hundred two million, twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •