Base | Representation |
---|---|
bin | 1001001011111101101110… |
… | …00111001101000110110111 |
3 | 2122112022200020211120122112 |
4 | 10211332313013031012313 |
5 | 10121443304121443221 |
6 | 110544450544121235 |
7 | 4153365623554061 |
oct | 445766707150667 |
9 | 78468606746575 |
10 | 20202303312311 |
11 | 648982660192a |
12 | 232341260621b |
13 | b370b88678b3 |
14 | 4dbb221d0731 |
15 | 25079563315b |
hex | 125fb71cd1b7 |
20202303312311 has 4 divisors (see below), whose sum is σ = 20336093400624. Its totient is φ = 20068513224000.
The previous prime is 20202303312259. The next prime is 20202303312371. The reversal of 20202303312311 is 11321330320202.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20202303312311 - 210 = 20202303311287 is a prime.
It is a super-2 number, since 2×202023033123112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20202303312371) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 66895043930 + ... + 66895044231.
It is an arithmetic number, because the mean of its divisors is an integer number (5084023350156).
Almost surely, 220202303312311 is an apocalyptic number.
20202303312311 is a deficient number, since it is larger than the sum of its proper divisors (133790088313).
20202303312311 is a wasteful number, since it uses less digits than its factorization.
20202303312311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133790088312.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 20202303312311 its reverse (11321330320202), we get a palindrome (31523633632513).
The spelling of 20202303312311 in words is "twenty trillion, two hundred two billion, three hundred three million, three hundred twelve thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •