Base | Representation |
---|---|
bin | 1010001011111111011011… |
… | …0101101100100100100001 |
3 | 1110122211001101022200011211 |
4 | 2202333312311230210201 |
5 | 2432004343434341001 |
6 | 35453420212510121 |
7 | 2234153135446024 |
oct | 242776665544441 |
9 | 43584041280154 |
10 | 11201121012001 |
11 | 3629406887008 |
12 | 130aa2891b341 |
13 | 633351a6cb2b |
14 | 2aa1cc4a51bb |
15 | 146578265351 |
hex | a2ff6d6c921 |
11201121012001 has 8 divisors (see below), whose sum is σ = 11288157425984. Its totient is φ = 11114253766800.
The previous prime is 11201121011933. The next prime is 11201121012041. The reversal of 11201121012001 is 10021012110211.
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 11201121012001 - 221 = 11201118914849 is a prime.
It is a super-2 number, since 2×112011210120012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11201121012041) 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, 42159255 + ... + 42424108.
It is an arithmetic number, because the mean of its divisors is an integer number (1411019678248).
Almost surely, 211201121012001 is an apocalyptic number.
It is an amenable number.
11201121012001 is a deficient number, since it is larger than the sum of its proper divisors (87036413983).
11201121012001 is an equidigital number, since it uses as much as digits as its factorization.
11201121012001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84584391.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11201121012001 its reverse (10021012110211), we get a palindrome (21222133122212).
The spelling of 11201121012001 in words is "eleven trillion, two hundred one billion, one hundred twenty-one million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •