Base | Representation |
---|---|
bin | 1111011110001001101001… |
… | …10001111000000010011001 |
3 | 11110110101222101102220112022 |
4 | 13233010310301320002121 |
5 | 13424401131242111213 |
6 | 200205102421424225 |
7 | 10110650026561214 |
oct | 757046461700231 |
9 | 143411871386468 |
10 | 34021321441433 |
11 | a9273a80241a7 |
12 | 399568786b075 |
13 | 15ca273616b01 |
14 | 8588d82b477b |
15 | 3dee8ca28308 |
hex | 1ef134c78099 |
34021321441433 has 2 divisors, whose sum is σ = 34021321441434. Its totient is φ = 34021321441432.
The previous prime is 34021321441379. The next prime is 34021321441439. The reversal of 34021321441433 is 33414412312043.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17516342674009 + 16504978767424 = 4185253^2 + 4062632^2 .
It is a cyclic number.
It is not a de Polignac number, because 34021321441433 - 26 = 34021321441369 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 34021321441393 and 34021321441402.
It is not a weakly prime, because it can be changed into another prime (34021321441439) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 17010660720716 + 17010660720717.
It is an arithmetic number, because the mean of its divisors is an integer number (17010660720717).
Almost surely, 234021321441433 is an apocalyptic number.
It is an amenable number.
34021321441433 is a deficient number, since it is larger than the sum of its proper divisors (1).
34021321441433 is an equidigital number, since it uses as much as digits as its factorization.
34021321441433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 82944, while the sum is 35.
Adding to 34021321441433 its reverse (33414412312043), we get a palindrome (67435733753476).
The spelling of 34021321441433 in words is "thirty-four trillion, twenty-one billion, three hundred twenty-one million, four hundred forty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •