Base | Representation |
---|---|
bin | 1011110000100101100… |
… | …1110010111111101011 |
3 | 201022110012120022112200 |
4 | 2330021121302333223 |
5 | 11302214413022311 |
6 | 232450211511243 |
7 | 20411163016440 |
oct | 2741131627753 |
9 | 638405508480 |
10 | 202021220331 |
11 | 78749791a27 |
12 | 331a05b8523 |
13 | 16086cb6238 |
14 | 9ac67019c7 |
15 | 53c5b29556 |
hex | 2f09672feb |
202021220331 has 24 divisors (see below), whose sum is σ = 333510777600. Its totient is φ = 115435356336.
The previous prime is 202021220311. The next prime is 202021220341. The reversal of 202021220331 is 133022120202.
It is not a de Polignac number, because 202021220331 - 29 = 202021219819 is a prime.
It is a super-2 number, since 2×2020212203312 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (202021220311) 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, 1593520 + ... + 1715618.
It is an arithmetic number, because the mean of its divisors is an integer number (13896282400).
Almost surely, 2202021220331 is an apocalyptic number.
202021220331 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
202021220331 is a deficient number, since it is larger than the sum of its proper divisors (131489557269).
202021220331 is a wasteful number, since it uses less digits than its factorization.
202021220331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148375 (or 148372 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 202021220331 its reverse (133022120202), we get a palindrome (335043340533).
The spelling of 202021220331 in words is "two hundred two billion, twenty-one million, two hundred twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •