Base | Representation |
---|---|
bin | 1010000110000111001011… |
… | …0101111000111000010101 |
3 | 1110022011100121021112202121 |
4 | 2201201302311320320111 |
5 | 2423331022242101401 |
6 | 35335154210135541 |
7 | 2223646243056433 |
oct | 241416265707025 |
9 | 43264317245677 |
10 | 11100122222101 |
11 | 359a598684310 |
12 | 12b33405815b1 |
13 | 626977357c63 |
14 | 2a536a92dd53 |
15 | 143b164d7ca1 |
hex | a1872d78e15 |
11100122222101 has 8 divisors (see below), whose sum is σ = 12220318044000. Its totient is φ = 9998442033840.
The previous prime is 11100122222089. The next prime is 11100122222117. The reversal of 11100122222101 is 10122222100111.
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 11100122222101 - 25 = 11100122222069 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100122222131) 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, 4628907151 + ... + 4628909548.
It is an arithmetic number, because the mean of its divisors is an integer number (1527539755500).
Almost surely, 211100122222101 is an apocalyptic number.
11100122222101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11100122222101 is a deficient number, since it is larger than the sum of its proper divisors (1120195821899).
11100122222101 is a wasteful number, since it uses less digits than its factorization.
11100122222101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9257816819.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11100122222101 its reverse (10122222100111), we get a palindrome (21222344322212).
The spelling of 11100122222101 in words is "eleven trillion, one hundred billion, one hundred twenty-two million, two hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •