Base | Representation |
---|---|
bin | 101101111011110100110001… |
… | …110110101110001111111100 |
3 | 222111022020020002002010112202 |
4 | 231323310301312232033330 |
5 | 202434422020030140443 |
6 | 1553400103300251032 |
7 | 60360460360215602 |
oct | 5573646166561774 |
9 | 874266202063482 |
10 | 202023213130748 |
11 | 59409622094909 |
12 | 1a7a95513a0a78 |
13 | 8895926ab6279 |
14 | 37c5d93401872 |
15 | 1855149e2b7b8 |
hex | b7bd31dae3fc |
202023213130748 has 24 divisors (see below), whose sum is σ = 379169685029520. Its totient is φ = 93889636289280.
The previous prime is 202023213130747. The next prime is 202023213130763. The reversal of 202023213130748 is 847031312320202.
It is a super-2 number, since 2×2020232131307482 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (38).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202023213130741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25077356093 + ... + 25077364148.
It is an arithmetic number, because the mean of its divisors is an integer number (15798736876230).
Almost surely, 2202023213130748 is an apocalyptic number.
It is an amenable number.
202023213130748 is a deficient number, since it is larger than the sum of its proper divisors (177146471898772).
202023213130748 is a wasteful number, since it uses less digits than its factorization.
202023213130748 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50154720317 (or 50154720315 counting only the distinct ones).
The product of its (nonzero) digits is 96768, while the sum is 38.
The spelling of 202023213130748 in words is "two hundred two trillion, twenty-three billion, two hundred thirteen million, one hundred thirty thousand, seven hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •