Base | Representation |
---|---|
bin | 1010010111110011101101… |
… | …0010111110100001010101 |
3 | 1111101020001122012021020111 |
4 | 2211330323102332201111 |
5 | 2443321131022020201 |
6 | 40130553020203021 |
7 | 2254631022051655 |
oct | 245747322764125 |
9 | 44336048167214 |
10 | 11404133001301 |
11 | 36a7513857367 |
12 | 1342245099471 |
13 | 6495360b06a1 |
14 | 2b5d6a5d0365 |
15 | 14b9aad4ab51 |
hex | a5f3b4be855 |
11404133001301 has 2 divisors, whose sum is σ = 11404133001302. Its totient is φ = 11404133001300.
The previous prime is 11404133001223. The next prime is 11404133001311. The reversal of 11404133001301 is 10310033140411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11360472480900 + 43660520401 = 3370530^2 + 208951^2 .
It is a cyclic number.
It is not a de Polignac number, because 11404133001301 - 29 = 11404133000789 is a prime.
It is a super-2 number, since 2×114041330013012 (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 (11404133001311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5702066500650 + 5702066500651.
It is an arithmetic number, because the mean of its divisors is an integer number (5702066500651).
Almost surely, 211404133001301 is an apocalyptic number.
It is an amenable number.
11404133001301 is a deficient number, since it is larger than the sum of its proper divisors (1).
11404133001301 is an equidigital number, since it uses as much as digits as its factorization.
11404133001301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 11404133001301 its reverse (10310033140411), we get a palindrome (21714166141712).
The spelling of 11404133001301 in words is "eleven trillion, four hundred four billion, one hundred thirty-three million, one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •