Base | Representation |
---|---|
bin | 100110110001111110011111… |
… | …0001001100011000001001011 |
3 | 1122201210202221100201001111202 |
4 | 1031203330332021203001023 |
5 | 324202403212420142311 |
6 | 3205300245334214415 |
7 | 131565060206501633 |
oct | 11543747611430113 |
9 | 1581722840631452 |
10 | 341120230240331 |
11 | 99767305a91573 |
12 | 32313476ab440b |
13 | 11845665a66c49 |
14 | 60344430b56c3 |
15 | 29684c00c6e3b |
hex | 1363f3e26304b |
341120230240331 has 2 divisors, whose sum is σ = 341120230240332. Its totient is φ = 341120230240330.
The previous prime is 341120230240271. The next prime is 341120230240337. The reversal of 341120230240331 is 133042032021143.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 341120230240331 - 234 = 341103050371147 is a prime.
It is a super-2 number, since 2×3411202302403312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 341120230240294 and 341120230240303.
It is not a weakly prime, because it can be changed into another prime (341120230240337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 170560115120165 + 170560115120166.
It is an arithmetic number, because the mean of its divisors is an integer number (170560115120166).
Almost surely, 2341120230240331 is an apocalyptic number.
341120230240331 is a deficient number, since it is larger than the sum of its proper divisors (1).
341120230240331 is an equidigital number, since it uses as much as digits as its factorization.
341120230240331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 341120230240331 its reverse (133042032021143), we get a palindrome (474162262261474).
The spelling of 341120230240331 in words is "three hundred forty-one trillion, one hundred twenty billion, two hundred thirty million, two hundred forty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •