Base | Representation |
---|---|
bin | 101101111011110100110001… |
… | …110010110101110100111100 |
3 | 222111022020020000011102202020 |
4 | 231323310301302311310330 |
5 | 202434422014300110322 |
6 | 1553400103222400140 |
7 | 60360460345450200 |
oct | 5573646162656474 |
9 | 874266200142666 |
10 | 202023212113212 |
11 | 5940962155a376 |
12 | 1a7a9550b90050 |
13 | 889592681b089 |
14 | 37c5d93218b00 |
15 | 1855149cca05c |
hex | b7bd31cb5d3c |
202023212113212 has 72 divisors (see below), whose sum is σ = 548850411755856. Its totient is φ = 57668107940352.
The previous prime is 202023212113211. The next prime is 202023212113231. The reversal of 202023212113212 is 212311212320202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202023212113211) 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 23 ways as a sum of consecutive naturals, for example, 156528813 + ... + 157814180.
It is an arithmetic number, because the mean of its divisors is an integer number (7622922385498).
Almost surely, 2202023212113212 is an apocalyptic number.
It is an amenable number.
202023212113212 is an abundant number, since it is smaller than the sum of its proper divisors (346827199642644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202023212113212 is a wasteful number, since it uses less digits than its factorization.
202023212113212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 314344107 (or 314344098 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 202023212113212 its reverse (212311212320202), we get a palindrome (414334424433414).
The spelling of 202023212113212 in words is "two hundred two trillion, twenty-three billion, two hundred twelve million, one hundred thirteen thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •