Base | Representation |
---|---|
bin | 1010000110110111111011… |
… | …1100101110010100010001 |
3 | 1110100102010201200212021020 |
4 | 2201231332330232110101 |
5 | 2424034323310223241 |
6 | 35345201023550053 |
7 | 2224621465312665 |
oct | 241557674562421 |
9 | 43312121625236 |
10 | 11113210242321 |
11 | 35a50a4508650 |
12 | 12b599375b329 |
13 | 627c81a37715 |
14 | 2a5c4cc4c8a5 |
15 | 144130524b66 |
hex | a1b7ef2e511 |
11113210242321 has 32 divisors (see below), whose sum is σ = 16314294205440. Its totient is φ = 6672945326400.
The previous prime is 11113210242269. The next prime is 11113210242341. The reversal of 11113210242321 is 12324201231111.
It is not a de Polignac number, because 11113210242321 - 27 = 11113210242193 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11113210242291 and 11113210242300.
It is not an unprimeable number, because it can be changed into a prime (11113210242341) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 46580866 + ... + 46818836.
It is an arithmetic number, because the mean of its divisors is an integer number (509821693920).
Almost surely, 211113210242321 is an apocalyptic number.
11113210242321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11113210242321 is a deficient number, since it is larger than the sum of its proper divisors (5201083963119).
11113210242321 is a wasteful number, since it uses less digits than its factorization.
11113210242321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 251077.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 11113210242321 its reverse (12324201231111), we get a palindrome (23437411473432).
The spelling of 11113210242321 in words is "eleven trillion, one hundred thirteen billion, two hundred ten million, two hundred forty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •