Base | Representation |
---|---|
bin | 1010001101101100001010… |
… | …1101100011011100011111 |
3 | 1110202121101200212120000121 |
4 | 2203123002231203130133 |
5 | 2432444134133431221 |
6 | 35515044520335411 |
7 | 2236235403313042 |
oct | 243330255433437 |
9 | 43677350776017 |
10 | 11230311233311 |
11 | 363a825a10355 |
12 | 1314614614567 |
13 | 63602443a131 |
14 | 2ab79b15ac59 |
15 | 1471d5c34a41 |
hex | a36c2b6371f |
11230311233311 has 4 divisors (see below), whose sum is σ = 11230638424432. Its totient is φ = 11229984042192.
The previous prime is 11230311233249. The next prime is 11230311233341. The reversal of 11230311233311 is 11333211303211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11230311233311 - 29 = 11230311232799 is a prime.
It is a super-2 number, since 2×112303112333112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11230311233341) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 163544070 + ... + 163612723.
It is an arithmetic number, because the mean of its divisors is an integer number (2807659606108).
Almost surely, 211230311233311 is an apocalyptic number.
11230311233311 is a deficient number, since it is larger than the sum of its proper divisors (327191121).
11230311233311 is an equidigital number, since it uses as much as digits as its factorization.
11230311233311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 327191120.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 11230311233311 its reverse (11333211303211), we get a palindrome (22563522536522).
The spelling of 11230311233311 in words is "eleven trillion, two hundred thirty billion, three hundred eleven million, two hundred thirty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •