Base | Representation |
---|---|
bin | 1010010001111010111101… |
… | …0011101100111001011101 |
3 | 1111000120000111212021010110 |
4 | 2210132233103230321131 |
5 | 2440142021013230323 |
6 | 40012305424000233 |
7 | 2244420610625025 |
oct | 244365723547135 |
9 | 44016014767113 |
10 | 11303000133213 |
11 | 36686369a7748 |
12 | 132671ba60079 |
13 | 63cb399829c9 |
14 | 2b10d4d16a85 |
15 | 14903c436793 |
hex | a47af4ece5d |
11303000133213 has 32 divisors (see below), whose sum is σ = 15710267768832. Its totient is φ = 7220350051200.
The previous prime is 11303000133127. The next prime is 11303000133259. The reversal of 11303000133213 is 31233100030311.
It is not a de Polignac number, because 11303000133213 - 221 = 11302998036061 is a prime.
It is a super-2 number, since 2×113030001332132 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11303000133213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11303000143213) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 64676356 + ... + 64850882.
It is an arithmetic number, because the mean of its divisors is an integer number (490945867776).
Almost surely, 211303000133213 is an apocalyptic number.
It is an amenable number.
11303000133213 is a deficient number, since it is larger than the sum of its proper divisors (4407267635619).
11303000133213 is a wasteful number, since it uses less digits than its factorization.
11303000133213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 181425.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 11303000133213 its reverse (31233100030311), we get a palindrome (42536100163524).
The spelling of 11303000133213 in words is "eleven trillion, three hundred three billion, one hundred thirty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •