Base | Representation |
---|---|
bin | 1010000111010100111111… |
… | …1110011111101010000001 |
3 | 1110101011021110021220110112 |
4 | 2201311033332133222001 |
5 | 2424201313100041001 |
6 | 35352531125041105 |
7 | 2225316022153511 |
oct | 241651776375201 |
9 | 43334243256415 |
10 | 11121012112001 |
11 | 35a843845a830 |
12 | 12b73b0556195 |
13 | 6289261c955c |
14 | 2a638d09d841 |
15 | 14443a434cbb |
hex | a1d4ff9fa81 |
11121012112001 has 8 divisors (see below), whose sum is σ = 12313088037984. Its totient is φ = 9959115323520.
The previous prime is 11121012111991. The next prime is 11121012112051. The reversal of 11121012112001 is 10021121012111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11121012112001 - 222 = 11121007917697 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11121012112051) 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, 7544783600 + ... + 7544785073.
It is an arithmetic number, because the mean of its divisors is an integer number (1539136004748).
Almost surely, 211121012112001 is an apocalyptic number.
11121012112001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11121012112001 is a deficient number, since it is larger than the sum of its proper divisors (1192075925983).
11121012112001 is a wasteful number, since it uses less digits than its factorization.
11121012112001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15089568751.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11121012112001 its reverse (10021121012111), we get a palindrome (21142133124112).
The spelling of 11121012112001 in words is "eleven trillion, one hundred twenty-one billion, twelve million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •