Base | Representation |
---|---|
bin | 1111100011101111000111… |
… | …00011101101100101101001 |
3 | 11111010202022222120202102021 |
4 | 13301313203203231211221 |
5 | 13441022144432134231 |
6 | 200433201505304441 |
7 | 10130552535146503 |
oct | 761674343554551 |
9 | 144122288522367 |
10 | 34213232302441 |
11 | a9a0828774565 |
12 | 3a06906335121 |
13 | 16123a8ab2aba |
14 | 863d01d26d73 |
15 | 3e4e70c45811 |
hex | 1f1de38ed969 |
34213232302441 has 2 divisors, whose sum is σ = 34213232302442. Its totient is φ = 34213232302440.
The previous prime is 34213232302429. The next prime is 34213232302471. The reversal of 34213232302441 is 14420323231243.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 34099935435225 + 113296867216 = 5839515^2 + 336596^2 .
It is a cyclic number.
It is not a de Polignac number, because 34213232302441 - 221 = 34213230205289 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 34213232302397 and 34213232302406.
It is not a weakly prime, because it can be changed into another prime (34213232302471) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 17106616151220 + 17106616151221.
It is an arithmetic number, because the mean of its divisors is an integer number (17106616151221).
Almost surely, 234213232302441 is an apocalyptic number.
It is an amenable number.
34213232302441 is a deficient number, since it is larger than the sum of its proper divisors (1).
34213232302441 is an equidigital number, since it uses as much as digits as its factorization.
34213232302441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 82944, while the sum is 34.
Adding to 34213232302441 its reverse (14420323231243), we get a palindrome (48633555533684).
The spelling of 34213232302441 in words is "thirty-four trillion, two hundred thirteen billion, two hundred thirty-two million, three hundred two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •