Base | Representation |
---|---|
bin | 1011110001010101011… |
… | …1101101110010110011 |
3 | 201022222012101001022000 |
4 | 2330111113231302303 |
5 | 11303122313020311 |
6 | 232522143145043 |
7 | 20416151436000 |
oct | 2742527556263 |
9 | 638865331260 |
10 | 202222001331 |
11 | 78842058739 |
12 | 332378a5183 |
13 | 160b9784b6c |
14 | 9b052488a7 |
15 | 53d858a056 |
hex | 2f155edcb3 |
202222001331 has 128 divisors (see below), whose sum is σ = 377809920000. Its totient is φ = 106440155136.
The previous prime is 202222001299. The next prime is 202222001353. The reversal of 202222001331 is 133100222202.
It is not a de Polignac number, because 202222001331 - 25 = 202222001299 is a prime.
It is a super-2 number, since 2×2022220013312 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (202222001431) 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 127 ways as a sum of consecutive naturals, for example, 7385875 + ... + 7413203.
It is an arithmetic number, because the mean of its divisors is an integer number (2951640000).
Almost surely, 2202222001331 is an apocalyptic number.
202222001331 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
202222001331 is a deficient number, since it is larger than the sum of its proper divisors (175587918669).
202222001331 is a wasteful number, since it uses less digits than its factorization.
202222001331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27423 (or 27403 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 202222001331 its reverse (133100222202), we get a palindrome (335322223533).
The spelling of 202222001331 in words is "two hundred two billion, two hundred twenty-two million, one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •