Base | Representation |
---|---|
bin | 1010000001101000010101… |
… | …0010100000000100111001 |
3 | 1110000210121100100021122212 |
4 | 2200122011102200010321 |
5 | 2421100323302114431 |
6 | 35235541422424505 |
7 | 2215252150410311 |
oct | 240320522400471 |
9 | 43023540307585 |
10 | 11023122301241 |
11 | 356a975192086 |
12 | 12a0431432135 |
13 | 61c6259346cb |
14 | 2a17443bc441 |
15 | 141b0b5c672b |
hex | a06854a0139 |
11023122301241 has 2 divisors, whose sum is σ = 11023122301242. Its totient is φ = 11023122301240.
The previous prime is 11023122301223. The next prime is 11023122301259. The reversal of 11023122301241 is 14210322132011.
It is a balanced prime because it is at equal distance from previous prime (11023122301223) and next prime (11023122301259).
It can be written as a sum of positive squares in only one way, i.e., 11011247622400 + 11874678841 = 3318320^2 + 108971^2 .
It is a cyclic number.
It is not a de Polignac number, because 11023122301241 - 226 = 11023055192377 is a prime.
It is not a weakly prime, because it can be changed into another prime (11023122301201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5511561150620 + 5511561150621.
It is an arithmetic number, because the mean of its divisors is an integer number (5511561150621).
Almost surely, 211023122301241 is an apocalyptic number.
It is an amenable number.
11023122301241 is a deficient number, since it is larger than the sum of its proper divisors (1).
11023122301241 is an equidigital number, since it uses as much as digits as its factorization.
11023122301241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 11023122301241 its reverse (14210322132011), we get a palindrome (25233444433252).
The spelling of 11023122301241 in words is "eleven trillion, twenty-three billion, one hundred twenty-two million, three hundred one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •