Base | Representation |
---|---|
bin | 101101111011101001100101… |
… | …111011111110011101101111 |
3 | 222111021002020000001112210201 |
4 | 231323221211323332131233 |
5 | 202434222420204134411 |
6 | 1553350355352414331 |
7 | 60356553622401601 |
oct | 5573514573763557 |
9 | 874232200045721 |
10 | 202011202021231 |
11 | 59404519135519 |
12 | 1a7a715a9a73a7 |
13 | 8894761561b85 |
14 | 37c5574131171 |
15 | 1854b957143c1 |
hex | b7ba65efe76f |
202011202021231 has 2 divisors, whose sum is σ = 202011202021232. Its totient is φ = 202011202021230.
The previous prime is 202011202021157. The next prime is 202011202021249. The reversal of 202011202021231 is 132120202110202.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 202011202021231 - 217 = 202011201890159 is a prime.
It is a super-2 number, since 2×2020112020212312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 202011202021199 and 202011202021208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202011202621231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101005601010615 + 101005601010616.
It is an arithmetic number, because the mean of its divisors is an integer number (101005601010616).
Almost surely, 2202011202021231 is an apocalyptic number.
202011202021231 is a deficient number, since it is larger than the sum of its proper divisors (1).
202011202021231 is an equidigital number, since it uses as much as digits as its factorization.
202011202021231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 202011202021231 its reverse (132120202110202), we get a palindrome (334131404131433).
The spelling of 202011202021231 in words is "two hundred two trillion, eleven billion, two hundred two million, twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •