Base | Representation |
---|---|
bin | 1010010001110011100101… |
… | …1010001110010000010101 |
3 | 1111000100220122220100111102 |
4 | 2210130321122032100111 |
5 | 2440123443131144341 |
6 | 40011341244315445 |
7 | 2244320602113254 |
oct | 244347132162025 |
9 | 44010818810442 |
10 | 11301022131221 |
11 | 3667811415559 |
12 | 1326269542b85 |
13 | 63c8b2c3b324 |
14 | 2b0d8834679b |
15 | 148e7396bc9b |
hex | a473968e415 |
11301022131221 has 2 divisors, whose sum is σ = 11301022131222. Its totient is φ = 11301022131220.
The previous prime is 11301022131173. The next prime is 11301022131317. The reversal of 11301022131221 is 12213122010311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10709184255121 + 591837876100 = 3272489^2 + 769310^2 .
It is a cyclic number.
It is not a de Polignac number, because 11301022131221 - 210 = 11301022130197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11301022131193 and 11301022131202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11301022931221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5650511065610 + 5650511065611.
It is an arithmetic number, because the mean of its divisors is an integer number (5650511065611).
Almost surely, 211301022131221 is an apocalyptic number.
It is an amenable number.
11301022131221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11301022131221 is an equidigital number, since it uses as much as digits as its factorization.
11301022131221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 11301022131221 its reverse (12213122010311), we get a palindrome (23514144141532).
The spelling of 11301022131221 in words is "eleven trillion, three hundred one billion, twenty-two million, one hundred thirty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •