Base | Representation |
---|---|
bin | 111101000110101110… |
… | …0101000101100101101 |
3 | 110112201002120000120211 |
4 | 1322031130220230231 |
5 | 4122220330104234 |
6 | 140141013142421 |
7 | 12323543362135 |
oct | 1721534505455 |
9 | 415632500524 |
10 | 131222113069 |
11 | 50718509833 |
12 | 2152202aa11 |
13 | c4b313c168 |
14 | 64cb913ac5 |
15 | 36302bb164 |
hex | 1e8d728b2d |
131222113069 has 2 divisors, whose sum is σ = 131222113070. Its totient is φ = 131222113068.
The previous prime is 131222113031. The next prime is 131222113159. The reversal of 131222113069 is 960311222131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 74750294025 + 56471819044 = 273405^2 + 237638^2 .
It is an emirp because it is prime and its reverse (960311222131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131222113069 - 217 = 131221981997 is a prime.
It is a super-2 number, since 2×1312221130692 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 131222113069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131222213069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65611056534 + 65611056535.
It is an arithmetic number, because the mean of its divisors is an integer number (65611056535).
Almost surely, 2131222113069 is an apocalyptic number.
It is an amenable number.
131222113069 is a deficient number, since it is larger than the sum of its proper divisors (1).
131222113069 is an equidigital number, since it uses as much as digits as its factorization.
131222113069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 31.
The spelling of 131222113069 in words is "one hundred thirty-one billion, two hundred twenty-two million, one hundred thirteen thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •