Base | Representation |
---|---|
bin | 11011110011111000000011… |
… | …110110111110110011000011 |
3 | 121001001221000120111120000001 |
4 | 123303320003312332303003 |
5 | 112012430232202301011 |
6 | 1112045231210140431 |
7 | 34522521635622526 |
oct | 3363700366766303 |
9 | 531057016446001 |
10 | 122312143400131 |
11 | 35a7731a307573 |
12 | 11874ab5421717 |
13 | 5332ca75822b9 |
14 | 222bd2172abbd |
15 | e21945e3b7c1 |
hex | 6f3e03dbecc3 |
122312143400131 has 2 divisors, whose sum is σ = 122312143400132. Its totient is φ = 122312143400130.
The previous prime is 122312143400123. The next prime is 122312143400137. The reversal of 122312143400131 is 131004341213221.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 122312143400131 - 23 = 122312143400123 is a prime.
It is a super-2 number, since 2×1223121434001312 (a number of 29 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 122312143400131.
It is not a weakly prime, because it can be changed into another prime (122312143400137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61156071700065 + 61156071700066.
It is an arithmetic number, because the mean of its divisors is an integer number (61156071700066).
Almost surely, 2122312143400131 is an apocalyptic number.
122312143400131 is a deficient number, since it is larger than the sum of its proper divisors (1).
122312143400131 is an equidigital number, since it uses as much as digits as its factorization.
122312143400131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 122312143400131 its reverse (131004341213221), we get a palindrome (253316484613352).
The spelling of 122312143400131 in words is "one hundred twenty-two trillion, three hundred twelve billion, one hundred forty-three million, four hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •