Base | Representation |
---|---|
bin | 11001000010011111010011… |
… | …110011100011111001011100 |
3 | 112102220120200212001122022212 |
4 | 121002133103303203321130 |
5 | 103413220301310323400 |
6 | 1030113241030455552 |
7 | 32124032161464533 |
oct | 3102372363437134 |
9 | 472816625048285 |
10 | 110122220011100 |
11 | 320a7631352530 |
12 | 104265108045b8 |
13 | 495a6333a565b |
14 | 1d29d3005331a |
15 | cae7e9539335 |
hex | 6427d3ce3e5c |
110122220011100 has 36 divisors (see below), whose sum is σ = 260689328101608. Its totient is φ = 40044443640000.
The previous prime is 110122220011057. The next prime is 110122220011103. The reversal of 110122220011100 is 1110022221011.
It is a super-2 number, since 2×1101222200111002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110122220011103) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 50055553451 + ... + 50055555650.
Almost surely, 2110122220011100 is an apocalyptic number.
110122220011100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110122220011100 is an abundant number, since it is smaller than the sum of its proper divisors (150567108090508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110122220011100 is a wasteful number, since it uses less digits than its factorization.
110122220011100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100111109126 (or 100111109119 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 110122220011100 its reverse (1110022221011), we get a palindrome (111232242232111).
The spelling of 110122220011100 in words is "one hundred ten trillion, one hundred twenty-two billion, two hundred twenty million, eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •