Base | Representation |
---|---|
bin | 1010010111101001001001… |
… | …1111110111101000001001 |
3 | 1111100221202021100021220121 |
4 | 2211322102133313220021 |
5 | 2443244331031001213 |
6 | 40125404013223241 |
7 | 2254500603522025 |
oct | 245722237675011 |
9 | 44327667307817 |
10 | 11401301031433 |
11 | 36a62a02234a5 |
12 | 1341794791b21 |
13 | 6491a446b981 |
14 | 2b5b7c447385 |
15 | 14b8923e888d |
hex | a5e927f7a09 |
11401301031433 has 2 divisors, whose sum is σ = 11401301031434. Its totient is φ = 11401301031432.
The previous prime is 11401301031413. The next prime is 11401301031443. The reversal of 11401301031433 is 33413010310411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6443210569104 + 4958090462329 = 2538348^2 + 2226677^2 .
It is a cyclic number.
It is not a de Polignac number, because 11401301031433 - 29 = 11401301030921 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11401301031398 and 11401301031407.
It is not a weakly prime, because it can be changed into another prime (11401301031413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5700650515716 + 5700650515717.
It is an arithmetic number, because the mean of its divisors is an integer number (5700650515717).
Almost surely, 211401301031433 is an apocalyptic number.
It is an amenable number.
11401301031433 is a deficient number, since it is larger than the sum of its proper divisors (1).
11401301031433 is an equidigital number, since it uses as much as digits as its factorization.
11401301031433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 11401301031433 its reverse (33413010310411), we get a palindrome (44814311341844).
The spelling of 11401301031433 in words is "eleven trillion, four hundred one billion, three hundred one million, thirty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •