Base | Representation |
---|---|
bin | 1010000111010110001001… |
… | …1010000100100100111011 |
3 | 1110101012002000010212012011 |
4 | 2201311202122010210323 |
5 | 2424202431230043003 |
6 | 35353021532430351 |
7 | 2225326465400602 |
oct | 241654232044473 |
9 | 43335060125164 |
10 | 11121321331003 |
11 | 35a8586a60624 |
12 | 12b74780183b7 |
13 | 6289752a4590 |
14 | 2a63bc192a39 |
15 | 14445766546d |
hex | a1d6268493b |
11121321331003 has 8 divisors (see below), whose sum is σ = 12048525000288. Its totient is φ = 10204363006464.
The previous prime is 11121321330979. The next prime is 11121321331009. The reversal of 11121321331003 is 30013312312111.
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 11121321331003 - 29 = 11121321330491 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11121321331009) 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, 2561333926 + ... + 2561338267.
It is an arithmetic number, because the mean of its divisors is an integer number (1506065625036).
Almost surely, 211121321331003 is an apocalyptic number.
11121321331003 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11121321331003 is a deficient number, since it is larger than the sum of its proper divisors (927203669285).
11121321331003 is a wasteful number, since it uses less digits than its factorization.
11121321331003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5122672373.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 11121321331003 its reverse (30013312312111), we get a palindrome (41134633643114).
The spelling of 11121321331003 in words is "eleven trillion, one hundred twenty-one billion, three hundred twenty-one million, three hundred thirty-one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •