Base | Representation |
---|---|
bin | 10000000000011110010… |
… | …111111010001111001111 |
3 | 10220011100100222110021111 |
4 | 100000132113322033033 |
5 | 121010320412241421 |
6 | 2201202012112451 |
7 | 142321360012303 |
oct | 20003627721717 |
9 | 3804310873244 |
10 | 1100021212111 |
11 | 394575329a68 |
12 | 159236a65727 |
13 | 7c9682c4313 |
14 | 3b354229d03 |
15 | 1d932790ee1 |
hex | 1001e5fa3cf |
1100021212111 has 8 divisors (see below), whose sum is σ = 1159496775920. Its totient is φ = 1040703619392.
The previous prime is 1100021212109. The next prime is 1100021212123. The reversal of 1100021212111 is 1112121200011.
It is a happy number.
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 1100021212111 - 21 = 1100021212109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1100021212091 and 1100021212100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100021212141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39478470 + ... + 39506323.
It is an arithmetic number, because the mean of its divisors is an integer number (144937096990).
Almost surely, 21100021212111 is an apocalyptic number.
1100021212111 is a deficient number, since it is larger than the sum of its proper divisors (59475563809).
1100021212111 is an equidigital number, since it uses as much as digits as its factorization.
1100021212111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78985545.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1100021212111 its reverse (1112121200011), we get a palindrome (2212142412122).
The spelling of 1100021212111 in words is "one trillion, one hundred billion, twenty-one million, two hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •