Base | Representation |
---|---|
bin | 10000000000011101110… |
… | …100110011101011100011 |
3 | 10220011022201122221122101 |
4 | 100000131310303223203 |
5 | 121010311033311321 |
6 | 2201201042551231 |
7 | 142321215545512 |
oct | 20003564635343 |
9 | 3804281587571 |
10 | 1100012010211 |
11 | 394570114494 |
12 | 159233968517 |
13 | 7c966421aca |
14 | 3b352d12679 |
15 | 1d931a74791 |
hex | 1001dd33ae3 |
1100012010211 has 8 divisors (see below), whose sum is σ = 1101352883904. Its totient is φ = 1098671747880.
The previous prime is 1100012010203. The next prime is 1100012010257. The reversal of 1100012010211 is 1120102100011.
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 1100012010211 - 23 = 1100012010203 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1100012010281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3500956 + ... + 3802198.
It is an arithmetic number, because the mean of its divisors is an integer number (137669110488).
Almost surely, 21100012010211 is an apocalyptic number.
1100012010211 is a deficient number, since it is larger than the sum of its proper divisors (1340873693).
1100012010211 is a wasteful number, since it uses less digits than its factorization.
1100012010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 305681.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1100012010211 its reverse (1120102100011), we get a palindrome (2220114110222).
It can be divided in two parts, 110001 and 2010211, that added together give a palindrome (2120212).
The spelling of 1100012010211 in words is "one trillion, one hundred billion, twelve million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.203 sec. • engine limits •