Base | Representation |
---|---|
bin | 1010001011111111101110… |
… | …0110110111110100100001 |
3 | 1110122211020221212002112210 |
4 | 2202333323212313310201 |
5 | 2432010024424341001 |
6 | 35453432151312333 |
7 | 2234155126442130 |
oct | 242777346676441 |
9 | 43584227762483 |
10 | 11201201012001 |
11 | 3629447a58210 |
12 | 130aa4b67b6a9 |
13 | 633365500200 |
14 | 2aa1d8d6b917 |
15 | 1465802b8dd6 |
hex | a2ffb9b7d21 |
11201201012001 has 96 divisors (see below), whose sum is σ = 20167221860352. Its totient is φ = 5369994938880.
The previous prime is 11201201011997. The next prime is 11201201012041. The reversal of 11201201012001 is 10021010210211.
It is not a de Polignac number, because 11201201012001 - 22 = 11201201011997 is a prime.
It is a super-2 number, since 2×112012010120012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11201201012041) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 187083996 + ... + 187143858.
It is an arithmetic number, because the mean of its divisors is an integer number (210075227712).
Almost surely, 211201201012001 is an apocalyptic number.
11201201012001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11201201012001 is a deficient number, since it is larger than the sum of its proper divisors (8966020848351).
11201201012001 is a wasteful number, since it uses less digits than its factorization.
11201201012001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64703 (or 64690 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11201201012001 its reverse (10021010210211), we get a palindrome (21222211222212).
The spelling of 11201201012001 in words is "eleven trillion, two hundred one billion, two hundred one million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •