Base | Representation |
---|---|
bin | 1011000001100110011000… |
… | …0100101001000100100101 |
3 | 1120220212021200222002110001 |
4 | 2300121212010221010211 |
5 | 3042102040202432044 |
6 | 41440453123301301 |
7 | 2360536122422533 |
oct | 260314604510445 |
9 | 46825250862401 |
10 | 12122110202149 |
11 | 3953a5a206042 |
12 | 143941a21a831 |
13 | 69c157b2767c |
14 | 2dc9db2a9153 |
15 | 1604cd2a62d4 |
hex | b0666129125 |
12122110202149 has 2 divisors, whose sum is σ = 12122110202150. Its totient is φ = 12122110202148.
The previous prime is 12122110202131. The next prime is 12122110202263. The reversal of 12122110202149 is 94120201122121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8965383350625 + 3156726851524 = 2994225^2 + 1776718^2 .
It is an emirp because it is prime and its reverse (94120201122121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12122110202149 - 217 = 12122110071077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12122110202129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6061055101074 + 6061055101075.
It is an arithmetic number, because the mean of its divisors is an integer number (6061055101075).
Almost surely, 212122110202149 is an apocalyptic number.
It is an amenable number.
12122110202149 is a deficient number, since it is larger than the sum of its proper divisors (1).
12122110202149 is an equidigital number, since it uses as much as digits as its factorization.
12122110202149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 28.
The spelling of 12122110202149 in words is "twelve trillion, one hundred twenty-two billion, one hundred ten million, two hundred two thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •