Base | Representation |
---|---|
bin | 1011000000111101000010… |
… | …0001011000111000001001 |
3 | 1120212210122012021102121012 |
4 | 2300033100201120320021 |
5 | 3041411322333033001 |
6 | 41431415521453305 |
7 | 2356664101560110 |
oct | 260172041307011 |
9 | 46783565242535 |
10 | 12111011221001 |
11 | 394a284112250 |
12 | 14372411a1235 |
13 | 69b0a95551c4 |
14 | 2dc2671d0c77 |
15 | 16007dbb42bb |
hex | b03d0858e09 |
12111011221001 has 16 divisors (see below), whose sum is σ = 15312110773248. Its totient is φ = 9304233968400.
The previous prime is 12111011220991. The next prime is 12111011221027. The reversal of 12111011221001 is 10012211011121.
It is a de Polignac number, because none of the positive numbers 2k-12111011221001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12111011221031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1107641435 + ... + 1107652368.
It is an arithmetic number, because the mean of its divisors is an integer number (957006923328).
Almost surely, 212111011221001 is an apocalyptic number.
12111011221001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12111011221001 is a deficient number, since it is larger than the sum of its proper divisors (3201099552247).
12111011221001 is a wasteful number, since it uses less digits than its factorization.
12111011221001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2215293892.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 12111011221001 its reverse (10012211011121), we get a palindrome (22123222232122).
The spelling of 12111011221001 in words is "twelve trillion, one hundred eleven billion, eleven million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •