Base | Representation |
---|---|
bin | 1010000001011101111001… |
… | …0110000000001011110001 |
3 | 1110000112101010222222112221 |
4 | 2200113132112000023301 |
5 | 2421024104241032423 |
6 | 35234355450121041 |
7 | 2215122560346631 |
oct | 240273626001361 |
9 | 43015333888487 |
10 | 11020321424113 |
11 | 35697681656a1 |
12 | 129b98b420181 |
13 | 61c29a58b171 |
14 | 2a155a40a6c1 |
15 | 1419e5766e5d |
hex | a05de5802f1 |
11020321424113 has 8 divisors (see below), whose sum is σ = 11023125474816. Its totient is φ = 11017517592000.
The previous prime is 11020321424107. The next prime is 11020321424117. The reversal of 11020321424113 is 31142412302011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11020321424113 - 237 = 10882882470641 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11020321424117) 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 in 7 ways as a sum of consecutive naturals, for example, 151111128 + ... + 151184038.
It is an arithmetic number, because the mean of its divisors is an integer number (1377890684352).
Almost surely, 211020321424113 is an apocalyptic number.
It is an amenable number.
11020321424113 is a deficient number, since it is larger than the sum of its proper divisors (2804050703).
11020321424113 is an equidigital number, since it uses as much as digits as its factorization.
11020321424113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109295.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 11020321424113 its reverse (31142412302011), we get a palindrome (42162733726124).
The spelling of 11020321424113 in words is "eleven trillion, twenty billion, three hundred twenty-one million, four hundred twenty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •