Base | Representation |
---|---|
bin | 101101100001100101011010… |
… | …000010011000100111110101 |
3 | 222020220211211010100102210221 |
4 | 231201211122002120213311 |
5 | 202220401030224342323 |
6 | 1545455444302414341 |
7 | 60113263163132500 |
oct | 5541453202304765 |
9 | 866824733312727 |
10 | 200220001012213 |
11 | 58883909935006 |
12 | 1a557b892913b1 |
13 | 879488524b610 |
14 | 37629b21b2137 |
15 | 18232ad3ce55d |
hex | b6195a0989f5 |
200220001012213 has 24 divisors (see below), whose sum is σ = 250851659546880. Its totient is φ = 158399022872160.
The previous prime is 200220001012123. The next prime is 200220001012237. The reversal of 200220001012213 is 312210100022002.
It is a happy number.
It is not a de Polignac number, because 200220001012213 - 213 = 200220001004021 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200220001012253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10656493 + ... + 22671586.
It is an arithmetic number, because the mean of its divisors is an integer number (10452152481120).
Almost surely, 2200220001012213 is an apocalyptic number.
It is an amenable number.
200220001012213 is a deficient number, since it is larger than the sum of its proper divisors (50631658534667).
200220001012213 is a wasteful number, since it uses less digits than its factorization.
200220001012213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33337537 (or 33337530 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 200220001012213 its reverse (312210100022002), we get a palindrome (512430101034215).
The spelling of 200220001012213 in words is "two hundred trillion, two hundred twenty billion, one million, twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •