Base | Representation |
---|---|
bin | 101101111011110010111010… |
… | …100110001111100101010011 |
3 | 222111022001001122012112002220 |
4 | 231323302322212033211103 |
5 | 202434403420323302011 |
6 | 1553355132544112123 |
7 | 60360356653505406 |
oct | 5573627246174523 |
9 | 874261048175086 |
10 | 202021212322131 |
11 | 59408795745774 |
12 | 1a7a9093305643 |
13 | 8895698417b47 |
14 | 37c5c437b5d3d |
15 | 185507e459506 |
hex | b7bcba98f953 |
202021212322131 has 32 divisors (see below), whose sum is σ = 277191317230080. Its totient is φ = 130780680862464.
The previous prime is 202021212322099. The next prime is 202021212322169. The reversal of 202021212322131 is 131223212120202.
It is not a de Polignac number, because 202021212322131 - 25 = 202021212322099 is a prime.
It is a super-2 number, since 2×2020212123221312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (202021212322031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 111817560 + ... + 113609898.
It is an arithmetic number, because the mean of its divisors is an integer number (8662228663440).
Almost surely, 2202021212322131 is an apocalyptic number.
202021212322131 is a deficient number, since it is larger than the sum of its proper divisors (75170104907949).
202021212322131 is a wasteful number, since it uses less digits than its factorization.
202021212322131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1794395.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 202021212322131 its reverse (131223212120202), we get a palindrome (333244424442333).
The spelling of 202021212322131 in words is "two hundred two trillion, twenty-one billion, two hundred twelve million, three hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •