Base | Representation |
---|---|
bin | 1010111011001000110101… |
… | …0111000110000011111011 |
3 | 1120112020202020001202020211 |
4 | 2232302031113012003323 |
5 | 3033242213122414321 |
6 | 41313453453531551 |
7 | 2346526155116116 |
oct | 256621527060373 |
9 | 46466666052224 |
10 | 12011100201211 |
11 | 3910973a31311 |
12 | 141b9b91a3bb7 |
13 | 6918462cb497 |
14 | 2d74a9cd357d |
15 | 15c6826a40e1 |
hex | aec8d5c60fb |
12011100201211 has 4 divisors (see below), whose sum is σ = 12155812251912. Its totient is φ = 11866388150512.
The previous prime is 12011100201209. The next prime is 12011100201227. The reversal of 12011100201211 is 11210200111021.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12011100201211 - 21 = 12011100201209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12011100201191 and 12011100201200.
It is not an unprimeable number, because it can be changed into a prime (12011100201811) 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, 72356025226 + ... + 72356025391.
It is an arithmetic number, because the mean of its divisors is an integer number (3038953062978).
Almost surely, 212011100201211 is an apocalyptic number.
12011100201211 is a deficient number, since it is larger than the sum of its proper divisors (144712050701).
12011100201211 is an equidigital number, since it uses as much as digits as its factorization.
12011100201211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 144712050700.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12011100201211 its reverse (11210200111021), we get a palindrome (23221300312232).
The spelling of 12011100201211 in words is "twelve trillion, eleven billion, one hundred million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •