Base | Representation |
---|---|
bin | 1010010010100001000010… |
… | …0010000001100010100001 |
3 | 1111001112101211121212202221 |
4 | 2210220100202001202201 |
5 | 2440323434112243241 |
6 | 40021115545111041 |
7 | 2245232111436340 |
oct | 244502042014241 |
9 | 44045354555687 |
10 | 11313221212321 |
11 | 3671a01491766 |
12 | 13286b2a88481 |
13 | 640aa83c7b02 |
14 | 2b17c4587b57 |
15 | 1494399145d1 |
hex | a4a108818a1 |
11313221212321 has 8 divisors (see below), whose sum is σ = 12934479999744. Its totient is φ = 9693233507040.
The previous prime is 11313221212313. The next prime is 11313221212333. The reversal of 11313221212321 is 12321212231311.
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 11313221212321 - 23 = 11313221212313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11313221212301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 317751460 + ... + 317787061.
It is an arithmetic number, because the mean of its divisors is an integer number (1616809999968).
Almost surely, 211313221212321 is an apocalyptic number.
It is an amenable number.
11313221212321 is a deficient number, since it is larger than the sum of its proper divisors (1621258787423).
11313221212321 is an equidigital number, since it uses as much as digits as its factorization.
11313221212321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 635541071.
The product of its digits is 864, while the sum is 25.
Adding to 11313221212321 its reverse (12321212231311), we get a palindrome (23634433443632).
The spelling of 11313221212321 in words is "eleven trillion, three hundred thirteen billion, two hundred twenty-one million, two hundred twelve thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •