Base | Representation |
---|---|
bin | 101101100001011101000010… |
… | …001000011001100100111100 |
3 | 222020212222121112011202101111 |
4 | 231201131002020121210330 |
5 | 202220224122030014322 |
6 | 1545451400202051404 |
7 | 60112524316610440 |
oct | 5541350210314474 |
9 | 866788545152344 |
10 | 200211010001212 |
11 | 58880015723401 |
12 | 1a55629a1a9b64 |
13 | 8793a815c7972 |
14 | 376239c05a820 |
15 | 1822e33dcb177 |
hex | b6174221993c |
200211010001212 has 24 divisors (see below), whose sum is σ = 404309612435456. Its totient is φ = 84971663050608.
The previous prime is 200211010001183. The next prime is 200211010001221. The reversal of 200211010001212 is 212100010112002.
It is a super-2 number, since 2×2002110100012122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200211010001192 and 200211010001201.
It is a congruent number.
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, 34710643788 + ... + 34710649555.
Almost surely, 2200211010001212 is an apocalyptic number.
It is an amenable number.
200211010001212 is an abundant number, since it is smaller than the sum of its proper divisors (204098602434244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200211010001212 is a wasteful number, since it uses less digits than its factorization.
200211010001212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69421293457 (or 69421293455 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200211010001212 its reverse (212100010112002), we get a palindrome (412311020113214).
The spelling of 200211010001212 in words is "two hundred trillion, two hundred eleven billion, ten million, one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •