Base | Representation |
---|---|
bin | 1001000110011101011111… |
… | …10111001100010101011111 |
3 | 2121212020120112110011012110 |
4 | 10203032233313030111133 |
5 | 10110344014444111221 |
6 | 110321534422405103 |
7 | 4133622554441412 |
oct | 443165767142537 |
9 | 77766515404173 |
10 | 20013203113311 |
11 | 6416608461531 |
12 | 22b2839290793 |
13 | b2231078cb15 |
14 | 4d2903979b79 |
15 | 24a8c9059776 |
hex | 1233afdcc55f |
20013203113311 has 8 divisors (see below), whose sum is σ = 27136546594560. Its totient is φ = 13115997520472.
The previous prime is 20013203113291. The next prime is 20013203113313. The reversal of 20013203113311 is 11331130231002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20013203113311 - 214 = 20013203096927 is a prime.
It is a super-2 number, since 2×200132031133112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20013203113313) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56534471895 + ... + 56534472248.
It is an arithmetic number, because the mean of its divisors is an integer number (3392068324320).
Almost surely, 220013203113311 is an apocalyptic number.
20013203113311 is a deficient number, since it is larger than the sum of its proper divisors (7123343481249).
20013203113311 is a wasteful number, since it uses less digits than its factorization.
20013203113311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113068944205.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 20013203113311 its reverse (11331130231002), we get a palindrome (31344333344313).
The spelling of 20013203113311 in words is "twenty trillion, thirteen billion, two hundred three million, one hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •