Base | Representation |
---|---|
bin | 1010010010100001011001… |
… | …1010111000011000110001 |
3 | 1111001112122201111222021110 |
4 | 2210220112122320120301 |
5 | 2440324134410044441 |
6 | 40021133434343533 |
7 | 2245234421234223 |
oct | 244502632703061 |
9 | 44045581458243 |
10 | 11313320003121 |
11 | 3671a52227754 |
12 | 132871bb8aba9 |
13 | 640ac2a070c6 |
14 | 2b17d3742413 |
15 | 14944342ab16 |
hex | a4a166b8631 |
11313320003121 has 8 divisors (see below), whose sum is σ = 15101905731840. Its totient is φ = 7533473804912.
The previous prime is 11313320003033. The next prime is 11313320003129. The reversal of 11313320003121 is 12130002331311.
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 11313320003121 - 213 = 11313319994929 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11313320003129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2184879606 + ... + 2184884783.
It is an arithmetic number, because the mean of its divisors is an integer number (1887738216480).
Almost surely, 211313320003121 is an apocalyptic number.
It is an amenable number.
11313320003121 is a deficient number, since it is larger than the sum of its proper divisors (3788585728719).
11313320003121 is an equidigital number, since it uses as much as digits as its factorization.
11313320003121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4369765255.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 11313320003121 its reverse (12130002331311), we get a palindrome (23443322334432).
The spelling of 11313320003121 in words is "eleven trillion, three hundred thirteen billion, three hundred twenty million, three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •