Base | Representation |
---|---|
bin | 1011000001100110011000… |
… | …0100101000110100010111 |
3 | 1120220212021200222001000121 |
4 | 2300121212010220310113 |
5 | 3042102040202413421 |
6 | 41440453123252411 |
7 | 2360536122416521 |
oct | 260314604506427 |
9 | 46825250861017 |
10 | 12122110201111 |
11 | 3953a5a205289 |
12 | 143941a21a107 |
13 | 69c157b27061 |
14 | 2dc9db2a8a11 |
15 | 1604cd2a5d41 |
hex | b0666128d17 |
12122110201111 has 4 divisors (see below), whose sum is σ = 12320833319224. Its totient is φ = 11923387083000.
The previous prime is 12122110201081. The next prime is 12122110201139. The reversal of 12122110201111 is 11110201122121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12122110201111 - 25 = 12122110201079 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 (12122110201211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 99361558965 + ... + 99361559086.
It is an arithmetic number, because the mean of its divisors is an integer number (3080208329806).
Almost surely, 212122110201111 is an apocalyptic number.
12122110201111 is a deficient number, since it is larger than the sum of its proper divisors (198723118113).
12122110201111 is an equidigital number, since it uses as much as digits as its factorization.
12122110201111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198723118112.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 12122110201111 its reverse (11110201122121), we get a palindrome (23232311323232).
The spelling of 12122110201111 in words is "twelve trillion, one hundred twenty-two billion, one hundred ten million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •