Base | Representation |
---|---|
bin | 101101111011101000101011… |
… | …100010010011000000110001 |
3 | 222111020222200201101001000101 |
4 | 231323220223202103000301 |
5 | 202434213413341223441 |
6 | 1553350114231552401 |
7 | 60356520424220422 |
oct | 5573505342230061 |
9 | 874228621331011 |
10 | 202010222211121 |
11 | 594040660516a5 |
12 | 1a7a6b2682b701 |
13 | 889463657368c |
14 | 37c54bdd5b649 |
15 | 1854b396c0231 |
hex | b7ba2b893031 |
202010222211121 has 12 divisors (see below), whose sum is σ = 214596720250560. Its totient is φ = 190123239809600.
The previous prime is 202010222211103. The next prime is 202010222211131. The reversal of 202010222211121 is 121112222010202.
It is not a de Polignac number, because 202010222211121 - 215 = 202010222178353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202010222211131) 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 11 ways as a sum of consecutive naturals, for example, 6303420 + ... + 21065458.
It is an arithmetic number, because the mean of its divisors is an integer number (17883060020880).
Almost surely, 2202010222211121 is an apocalyptic number.
It is an amenable number.
202010222211121 is a deficient number, since it is larger than the sum of its proper divisors (12586498039439).
202010222211121 is a wasteful number, since it uses less digits than its factorization.
202010222211121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14809424 (or 14809407 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 202010222211121 its reverse (121112222010202), we get a palindrome (323122444221323).
The spelling of 202010222211121 in words is "two hundred two trillion, ten billion, two hundred twenty-two million, two hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •