Base | Representation |
---|---|
bin | 1010010010100001010100… |
… | …1111011010100001110101 |
3 | 1111001112121100021212222001 |
4 | 2210220111033122201311 |
5 | 2440324114324020041 |
6 | 40021131450335301 |
7 | 2245234061130442 |
oct | 244502517324165 |
9 | 44045540255861 |
10 | 11313300220021 |
11 | 3671a42045388 |
12 | 132871542a531 |
13 | 640abb89b627 |
14 | 2b17d0c729c9 |
15 | 14944181e131 |
hex | a4a153da875 |
11313300220021 has 4 divisors (see below), whose sum is σ = 11456506552000. Its totient is φ = 11170093888044.
The previous prime is 11313300219979. The next prime is 11313300220043. The reversal of 11313300220021 is 12002200331311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11313300220021 - 241 = 9114276964469 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11313310220021) 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, 71603165871 + ... + 71603166028.
It is an arithmetic number, because the mean of its divisors is an integer number (2864126638000).
Almost surely, 211313300220021 is an apocalyptic number.
It is an amenable number.
11313300220021 is a deficient number, since it is larger than the sum of its proper divisors (143206331979).
11313300220021 is an equidigital number, since it uses as much as digits as its factorization.
11313300220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143206331978.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 11313300220021 its reverse (12002200331311), we get a palindrome (23315500551332).
The spelling of 11313300220021 in words is "eleven trillion, three hundred thirteen billion, three hundred million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •