Base | Representation |
---|---|
bin | 1010010011111000111110… |
… | …1101000010000111111101 |
3 | 1111010210100011001022220012 |
4 | 2210332033231002013331 |
5 | 2441220311342004323 |
6 | 40040022335433005 |
7 | 2250026130662156 |
oct | 244761755020775 |
9 | 44123304038805 |
10 | 11336829641213 |
11 | 3680a1686681a |
12 | 13311a1385765 |
13 | 64309b54426b |
14 | 2b29c3bb492d |
15 | 149d6c359678 |
hex | a4f8fb421fd |
11336829641213 has 16 divisors (see below), whose sum is σ = 11540946915696. Its totient is φ = 11134040924160.
The previous prime is 11336829641209. The next prime is 11336829641243. The reversal of 11336829641213 is 31214692863311.
It can be written as a sum of positive squares in 8 ways, for example, as 2361640518169 + 8975189123044 = 1536763^2 + 2995862^2 .
It is a cyclic number.
It is not a de Polignac number, because 11336829641213 - 22 = 11336829641209 is a prime.
It is a super-2 number, since 2×113368296412132 (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 (11336829641243) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 224408645 + ... + 224459157.
It is an arithmetic number, because the mean of its divisors is an integer number (721309182231).
Almost surely, 211336829641213 is an apocalyptic number.
It is an amenable number.
11336829641213 is a deficient number, since it is larger than the sum of its proper divisors (204117274483).
11336829641213 is a wasteful number, since it uses less digits than its factorization.
11336829641213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63584.
The product of its digits is 1119744, while the sum is 50.
The spelling of 11336829641213 in words is "eleven trillion, three hundred thirty-six billion, eight hundred twenty-nine million, six hundred forty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •