Base | Representation |
---|---|
bin | 111101000011101111… |
… | …1111000110100001101 |
3 | 110112110010202002211202 |
4 | 1322013133320310031 |
5 | 4122014302132341 |
6 | 140123045555245 |
7 | 12321222115331 |
oct | 1720737706415 |
9 | 415403662752 |
10 | 131122302221 |
11 | 50677137429 |
12 | 214b4715b25 |
13 | c4985637a1 |
14 | 64bc5717c1 |
15 | 362665279b |
hex | 1e877f8d0d |
131122302221 has 2 divisors, whose sum is σ = 131122302222. Its totient is φ = 131122302220.
The previous prime is 131122302187. The next prime is 131122302331. The reversal of 131122302221 is 122203221131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 68115780100 + 63006522121 = 260990^2 + 251011^2 .
It is an emirp because it is prime and its reverse (122203221131) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131122302221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131122302193 and 131122302202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131122308221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65561151110 + 65561151111.
It is an arithmetic number, because the mean of its divisors is an integer number (65561151111).
Almost surely, 2131122302221 is an apocalyptic number.
It is an amenable number.
131122302221 is a deficient number, since it is larger than the sum of its proper divisors (1).
131122302221 is an equidigital number, since it uses as much as digits as its factorization.
131122302221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 131122302221 its reverse (122203221131), we get a palindrome (253325523352).
The spelling of 131122302221 in words is "one hundred thirty-one billion, one hundred twenty-two million, three hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •