Base | Representation |
---|---|
bin | 10100010110000… |
… | …110111101110111 |
3 | 212210021212111002 |
4 | 110112012331313 |
5 | 1144340340043 |
6 | 53512033515 |
7 | 11313225263 |
oct | 2426067567 |
9 | 783255432 |
10 | 341340023 |
11 | 16574a8a2 |
12 | 9639289b |
13 | 5594355b |
14 | 334950a3 |
15 | 1ee77bb8 |
hex | 14586f77 |
341340023 has 2 divisors, whose sum is σ = 341340024. Its totient is φ = 341340022.
The previous prime is 341340017. The next prime is 341340029. The reversal of 341340023 is 320043143.
It is a balanced prime because it is at equal distance from previous prime (341340017) and next prime (341340029).
It is a cyclic number.
It is not a de Polignac number, because 341340023 - 24 = 341340007 is a prime.
It is a super-2 number, since 2×3413400232 = 233026022603281058, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 341339977 and 341340004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (341340029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 170670011 + 170670012.
It is an arithmetic number, because the mean of its divisors is an integer number (170670012).
Almost surely, 2341340023 is an apocalyptic number.
341340023 is a deficient number, since it is larger than the sum of its proper divisors (1).
341340023 is an equidigital number, since it uses as much as digits as its factorization.
341340023 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 20.
The square root of 341340023 is about 18475.3896575959. The cubic root of 341340023 is about 698.8689373546.
Adding to 341340023 its reverse (320043143), we get a palindrome (661383166).
The spelling of 341340023 in words is "three hundred forty-one million, three hundred forty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •