Base | Representation |
---|---|
bin | 1010000010100001001110… |
… | …1010111011011010011111 |
3 | 1110002021000210110002222222 |
4 | 2200220103222323122133 |
5 | 2421323113332034411 |
6 | 35250545154255555 |
7 | 2216332512434366 |
oct | 240502352733237 |
9 | 43067023402888 |
10 | 11038395971231 |
11 | 35763a2834442 |
12 | 12a33945875bb |
13 | 620bbb08cb65 |
14 | 2a2392ac07dd |
15 | 1422024484db |
hex | a0a13abb69f |
11038395971231 has 2 divisors, whose sum is σ = 11038395971232. Its totient is φ = 11038395971230.
The previous prime is 11038395971219. The next prime is 11038395971233. The reversal of 11038395971231 is 13217959383011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11038395971231 - 222 = 11038391776927 is a prime.
It is a super-3 number, since 3×110383959712313 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 11038395971233, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11038395971233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5519197985615 + 5519197985616.
It is an arithmetic number, because the mean of its divisors is an integer number (5519197985616).
Almost surely, 211038395971231 is an apocalyptic number.
11038395971231 is a deficient number, since it is larger than the sum of its proper divisors (1).
11038395971231 is an equidigital number, since it uses as much as digits as its factorization.
11038395971231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1224720, while the sum is 53.
The spelling of 11038395971231 in words is "eleven trillion, thirty-eight billion, three hundred ninety-five million, nine hundred seventy-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •