Base | Representation |
---|---|
bin | 1010010011101011100000… |
… | …0101010010010100101001 |
3 | 1111010110000001001020012102 |
4 | 2210322320011102110221 |
5 | 2441140404300322421 |
6 | 40034223351423145 |
7 | 2246540363365145 |
oct | 244727005222451 |
9 | 44113001036172 |
10 | 11333212120361 |
11 | 367a42a87086a |
12 | 1330551984ab5 |
13 | 642942c3b291 |
14 | 2b275d584225 |
15 | 149c0998660b |
hex | a4eb8152529 |
11333212120361 has 2 divisors, whose sum is σ = 11333212120362. Its totient is φ = 11333212120360.
The previous prime is 11333212120207. The next prime is 11333212120421. The reversal of 11333212120361 is 16302121233311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11332648960000 + 563160361 = 3366400^2 + 23731^2 .
It is a cyclic number.
It is not a de Polignac number, because 11333212120361 - 210 = 11333212119337 is a prime.
It is not a weakly prime, because it can be changed into another prime (11333212123361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5666606060180 + 5666606060181.
It is an arithmetic number, because the mean of its divisors is an integer number (5666606060181).
Almost surely, 211333212120361 is an apocalyptic number.
It is an amenable number.
11333212120361 is a deficient number, since it is larger than the sum of its proper divisors (1).
11333212120361 is an equidigital number, since it uses as much as digits as its factorization.
11333212120361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 29.
Adding to 11333212120361 its reverse (16302121233311), we get a palindrome (27635333353672).
The spelling of 11333212120361 in words is "eleven trillion, three hundred thirty-three billion, two hundred twelve million, one hundred twenty thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •