Base | Representation |
---|---|
bin | 111000111010001111… |
… | …0110010011001101111 |
3 | 102200110020220111221002 |
4 | 1301310132302121233 |
5 | 4000243101441421 |
6 | 132051035230515 |
7 | 11554363004252 |
oct | 1616436623157 |
9 | 380406814832 |
10 | 122213312111 |
11 | 47915257290 |
12 | 1b828ba843b |
13 | b6a88c9cc7 |
14 | 5cb528b099 |
15 | 32a4451b0b |
hex | 1c747b266f |
122213312111 has 4 divisors (see below), whose sum is σ = 133323613224. Its totient is φ = 111103011000.
The previous prime is 122213312087. The next prime is 122213312183. The reversal of 122213312111 is 111213312221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 111213312221 = 11 ⋅10110301111.
It is a cyclic number.
It is not a de Polignac number, because 122213312111 - 214 = 122213295727 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122213312911) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5555150540 + ... + 5555150561.
It is an arithmetic number, because the mean of its divisors is an integer number (33330903306).
Almost surely, 2122213312111 is an apocalyptic number.
122213312111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
122213312111 is a deficient number, since it is larger than the sum of its proper divisors (11110301113).
122213312111 is a wasteful number, since it uses less digits than its factorization.
122213312111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11110301112.
The product of its digits is 144, while the sum is 20.
Adding to 122213312111 its reverse (111213312221), we get a palindrome (233426624332).
The spelling of 122213312111 in words is "one hundred twenty-two billion, two hundred thirteen million, three hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •