Base | Representation |
---|---|
bin | 1010000111010100111111… |
… | …1010101101101101101001 |
3 | 1110101011021101102120001211 |
4 | 2201311033322231231221 |
5 | 2424201312321333001 |
6 | 35352531051513121 |
7 | 2225316010555345 |
oct | 241651772555551 |
9 | 43334241376054 |
10 | 11121011121001 |
11 | 35a8437943221 |
12 | 12b73b01587a1 |
13 | 628925c40472 |
14 | 2a638ccc2625 |
15 | 14443a2db351 |
hex | a1d4feadb69 |
11121011121001 has 4 divisors (see below), whose sum is σ = 11167156395604. Its totient is φ = 11074865846400.
The previous prime is 11121011120993. The next prime is 11121011121041. The reversal of 11121011121001 is 10012111012111.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3005212938025 + 8115798182976 = 1733555^2 + 2848824^2 .
It is a cyclic number.
It is not a de Polignac number, because 11121011121001 - 23 = 11121011120993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11121011121041) 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, 23072636940 + ... + 23072637421.
It is an arithmetic number, because the mean of its divisors is an integer number (2791789098901).
Almost surely, 211121011121001 is an apocalyptic number.
It is an amenable number.
11121011121001 is a deficient number, since it is larger than the sum of its proper divisors (46145274603).
11121011121001 is an equidigital number, since it uses as much as digits as its factorization.
11121011121001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46145274602.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11121011121001 its reverse (10012111012111), we get a palindrome (21133122133112).
The spelling of 11121011121001 in words is "eleven trillion, one hundred twenty-one billion, eleven million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •