Base | Representation |
---|---|
bin | 1010001101011001100101… |
… | …0010100000011101101101 |
3 | 1110202010111221110012011101 |
4 | 2203112121102200131231 |
5 | 2432403424223410221 |
6 | 35512501425123101 |
7 | 2236000632544615 |
oct | 243263122403555 |
9 | 43663457405141 |
10 | 11225321310061 |
11 | 36386a5266141 |
12 | 1313661489491 |
13 | 63570a6c9021 |
14 | 2ab44655da45 |
15 | 146ee2b1dd91 |
hex | a35994a076d |
11225321310061 has 2 divisors, whose sum is σ = 11225321310062. Its totient is φ = 11225321310060.
The previous prime is 11225321310013. The next prime is 11225321310101. The reversal of 11225321310061 is 16001312352211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7312319056900 + 3913002253161 = 2704130^2 + 1978131^2 .
It is a cyclic number.
It is not a de Polignac number, because 11225321310061 - 217 = 11225321178989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11225321310011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5612660655030 + 5612660655031.
It is an arithmetic number, because the mean of its divisors is an integer number (5612660655031).
Almost surely, 211225321310061 is an apocalyptic number.
It is an amenable number.
11225321310061 is a deficient number, since it is larger than the sum of its proper divisors (1).
11225321310061 is an equidigital number, since it uses as much as digits as its factorization.
11225321310061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 28.
Adding to 11225321310061 its reverse (16001312352211), we get a palindrome (27226633662272).
The spelling of 11225321310061 in words is "eleven trillion, two hundred twenty-five billion, three hundred twenty-one million, three hundred ten thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •