Base | Representation |
---|---|
bin | 10000000000011101000… |
… | …111011101010011111111 |
3 | 10220011021220021222020101 |
4 | 100000131013131103333 |
5 | 121010300012401421 |
6 | 2201155540101531 |
7 | 142321012523362 |
oct | 20003507352377 |
9 | 3804256258211 |
10 | 1100000122111 |
11 | 394564434810 |
12 | 15922b9948a7 |
13 | 7c963b1ba27 |
14 | 3b3514da0d9 |
15 | 1d9309c7191 |
hex | 1001d1dd4ff |
1100000122111 has 96 divisors (see below), whose sum is σ = 1319969903616. Its totient is φ = 908330112000.
The previous prime is 1100000122103. The next prime is 1100000122139. The reversal of 1100000122111 is 1112210000011.
It is not a de Polignac number, because 1100000122111 - 23 = 1100000122103 is a prime.
It is a super-2 number, since 2×11000001221112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100000122511) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 4059040906 + ... + 4059041176.
It is an arithmetic number, because the mean of its divisors is an integer number (13749686496).
Almost surely, 21100000122111 is an apocalyptic number.
1100000122111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1100000122111 is a deficient number, since it is larger than the sum of its proper divisors (219969781505).
1100000122111 is a wasteful number, since it uses less digits than its factorization.
1100000122111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 701 (or 682 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1100000122111 its reverse (1112210000011), we get a palindrome (2212210122122).
The spelling of 1100000122111 in words is "one trillion, one hundred billion, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •