Base | Representation |
---|---|
bin | 1001111011001101000… |
… | …11111110001011010011 |
3 | 1012121020111011112221212 |
4 | 10331212203332023103 |
5 | 21041403404402011 |
6 | 420355221010335 |
7 | 33431604465446 |
oct | 4754643761323 |
9 | 1177214145855 |
10 | 341023122131 |
11 | 12169973111a |
12 | 56113b539ab |
13 | 26209b55883 |
14 | 1271155965d |
15 | 8d0dde308b |
hex | 4f668fe2d3 |
341023122131 has 2 divisors, whose sum is σ = 341023122132. Its totient is φ = 341023122130.
The previous prime is 341023122127. The next prime is 341023122133. The reversal of 341023122131 is 131221320143.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 341023122131 - 22 = 341023122127 is a prime.
It is a super-2 number, since 2×3410231221312 (a number of 24 digits) contains 22 as substring.
Together with 341023122133, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 341023122097 and 341023122106.
It is not a weakly prime, because it can be changed into another prime (341023122133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 170511561065 + 170511561066.
It is an arithmetic number, because the mean of its divisors is an integer number (170511561066).
Almost surely, 2341023122131 is an apocalyptic number.
341023122131 is a deficient number, since it is larger than the sum of its proper divisors (1).
341023122131 is an equidigital number, since it uses as much as digits as its factorization.
341023122131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 341023122131 its reverse (131221320143), we get a palindrome (472244442274).
The spelling of 341023122131 in words is "three hundred forty-one billion, twenty-three million, one hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •