Base | Representation |
---|---|
bin | 1011000001100110000011… |
… | …0100010000101111011111 |
3 | 1120220212001120001002011201 |
4 | 2300121200310100233133 |
5 | 3042101400114201421 |
6 | 41440440253300331 |
7 | 2360534002050061 |
oct | 260314064205737 |
9 | 46825046032151 |
10 | 12122022022111 |
11 | 3953a14458081 |
12 | 14393b47946a7 |
13 | 69c142791c31 |
14 | 2dc9cd6b3731 |
15 | 1604c5688b91 |
hex | b0660d10bdf |
12122022022111 has 8 divisors (see below), whose sum is σ = 12161127417984. Its totient is φ = 12082978947480.
The previous prime is 12122022022093. The next prime is 12122022022129. The reversal of 12122022022111 is 11122022022121.
It is an interprime number because it is at equal distance from previous prime (12122022022093) and next prime (12122022022129).
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 12122022022111 - 223 = 12122013633503 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 (12122022022211) 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, 15190651 + ... + 15968716.
It is an arithmetic number, because the mean of its divisors is an integer number (1520140927248).
Almost surely, 212122022022111 is an apocalyptic number.
12122022022111 is a deficient number, since it is larger than the sum of its proper divisors (39105395873).
12122022022111 is an equidigital number, since it uses as much as digits as its factorization.
12122022022111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31160621.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 12122022022111 its reverse (11122022022121), we get a palindrome (23244044044232).
The spelling of 12122022022111 in words is "twelve trillion, one hundred twenty-two billion, twenty-two million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •