Base | Representation |
---|---|
bin | 1010001101111011011100… |
… | …1101110001110011100001 |
3 | 1110202222222120200020001121 |
4 | 2203132313031301303201 |
5 | 2433031034302241231 |
6 | 35521003534332241 |
7 | 2236442143426462 |
oct | 243366715616341 |
9 | 43688876606047 |
10 | 11234413321441 |
11 | 3641540491932 |
12 | 131537a35a081 |
13 | 63652925390b |
14 | 2aba69c86d69 |
15 | 147375e23311 |
hex | a37b7371ce1 |
11234413321441 has 2 divisors, whose sum is σ = 11234413321442. Its totient is φ = 11234413321440.
The previous prime is 11234413321421. The next prime is 11234413321447. The reversal of 11234413321441 is 14412331443211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8609676350625 + 2624736970816 = 2934225^2 + 1620104^2 .
It is a cyclic number.
It is not a de Polignac number, because 11234413321441 - 25 = 11234413321409 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11234413321397 and 11234413321406.
It is not a weakly prime, because it can be changed into another prime (11234413321447) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5617206660720 + 5617206660721.
It is an arithmetic number, because the mean of its divisors is an integer number (5617206660721).
Almost surely, 211234413321441 is an apocalyptic number.
It is an amenable number.
11234413321441 is a deficient number, since it is larger than the sum of its proper divisors (1).
11234413321441 is an equidigital number, since it uses as much as digits as its factorization.
11234413321441 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 27648, while the sum is 34.
Adding to 11234413321441 its reverse (14412331443211), we get a palindrome (25646744764652).
The spelling of 11234413321441 in words is "eleven trillion, two hundred thirty-four billion, four hundred thirteen million, three hundred twenty-one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •