Base | Representation |
---|---|
bin | 1010010011011111100010… |
… | …1000000001001100110001 |
3 | 1111010010201011212121010222 |
4 | 2210313320220001030301 |
5 | 2441112314444443133 |
6 | 40032532524502425 |
7 | 2246364650664146 |
oct | 244677050011461 |
9 | 44103634777128 |
10 | 11329999999793 |
11 | 367903169a072 |
12 | 132b9b60aaa15 |
13 | 642550617917 |
14 | 2b2536b223cd |
15 | 149abc991e98 |
hex | a4df8a01331 |
11329999999793 has 2 divisors, whose sum is σ = 11329999999794. Its totient is φ = 11329999999792.
The previous prime is 11329999999673. The next prime is 11329999999837. The reversal of 11329999999793 is 39799999992311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6418404370849 + 4911595628944 = 2533457^2 + 2216212^2 .
It is a cyclic number.
It is not a de Polignac number, because 11329999999793 - 228 = 11329731564337 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11329999999699 and 11329999999708.
It is not a weakly prime, because it can be changed into another prime (11329999999993) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5664999999896 + 5664999999897.
It is an arithmetic number, because the mean of its divisors is an integer number (5664999999897).
Almost surely, 211329999999793 is an apocalyptic number.
It is an amenable number.
11329999999793 is a deficient number, since it is larger than the sum of its proper divisors (1).
11329999999793 is an equidigital number, since it uses as much as digits as its factorization.
11329999999793 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5423886846, while the sum is 89.
The spelling of 11329999999793 in words is "eleven trillion, three hundred twenty-nine billion, nine hundred ninety-nine million, nine hundred ninety-nine thousand, seven hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •