Base | Representation |
---|---|
bin | 1010010001110011100010… |
… | …1101001101001000101101 |
3 | 1111000100212211200210110222 |
4 | 2210130320231031020231 |
5 | 2440123432121031112 |
6 | 40011340143341125 |
7 | 2244320366602652 |
oct | 244347055151055 |
9 | 44010784623428 |
10 | 11301010330157 |
11 | 3667805795209 |
12 | 13262655b17a5 |
13 | 63c8b0668a52 |
14 | 2b0d86953c29 |
15 | 148e728da372 |
hex | a4738b4d22d |
11301010330157 has 2 divisors, whose sum is σ = 11301010330158. Its totient is φ = 11301010330156.
The previous prime is 11301010330139. The next prime is 11301010330219. The reversal of 11301010330157 is 75103301010311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6712379362276 + 4588630967881 = 2590826^2 + 2142109^2 .
It is a cyclic number.
It is not a de Polignac number, because 11301010330157 - 212 = 11301010326061 is a prime.
It is a super-2 number, since 2×113010103301572 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11301010330457) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5650505165078 + 5650505165079.
It is an arithmetic number, because the mean of its divisors is an integer number (5650505165079).
Almost surely, 211301010330157 is an apocalyptic number.
It is an amenable number.
11301010330157 is a deficient number, since it is larger than the sum of its proper divisors (1).
11301010330157 is an equidigital number, since it uses as much as digits as its factorization.
11301010330157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 945, while the sum is 26.
Adding to 11301010330157 its reverse (75103301010311), we get a palindrome (86404311340468).
The spelling of 11301010330157 in words is "eleven trillion, three hundred one billion, ten million, three hundred thirty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •