Base | Representation |
---|---|
bin | 1011000000111101000100… |
… | …0111000100101111100001 |
3 | 1120212210122212212100001002 |
4 | 2300033101013010233201 |
5 | 3041411332400200001 |
6 | 41431420513321345 |
7 | 2356664251543625 |
oct | 260172107045741 |
9 | 46783585770032 |
10 | 12111021100001 |
11 | 394a28974a50a |
12 | 1437244566255 |
13 | 69b0ab603975 |
14 | 2dc268643185 |
15 | 16007e9b646b |
hex | b03d11c4be1 |
12111021100001 has 4 divisors (see below), whose sum is σ = 12134266822404. Its totient is φ = 12087775377600.
The previous prime is 12111021099823. The next prime is 12111021100007. The reversal of 12111021100001 is 10000112011121.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7241050446400 + 4869970653601 = 2690920^2 + 2206801^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12111021100001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12111021100007) 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, 11622860420 + ... + 11622861461.
It is an arithmetic number, because the mean of its divisors is an integer number (3033566705601).
Almost surely, 212111021100001 is an apocalyptic number.
It is an amenable number.
12111021100001 is a deficient number, since it is larger than the sum of its proper divisors (23245722403).
12111021100001 is an equidigital number, since it uses as much as digits as its factorization.
12111021100001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23245722402.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 12111021100001 its reverse (10000112011121), we get a palindrome (22111133111122).
The spelling of 12111021100001 in words is "twelve trillion, one hundred eleven billion, twenty-one million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •