Base | Representation |
---|---|
bin | 1010000001100001100101… |
… | …1100100110111001111001 |
3 | 1110000121221020211211111002 |
4 | 2200120121130212321321 |
5 | 2421033122112330241 |
6 | 35235042111214345 |
7 | 2215156260611504 |
oct | 240303134467171 |
9 | 43017836754432 |
10 | 11021313011321 |
11 | 356a126962858 |
12 | 12a00075173b5 |
13 | 61c3c7b41062 |
14 | 2a1611da813b |
15 | 141a5283589b |
hex | a0619726e79 |
11021313011321 has 8 divisors (see below), whose sum is σ = 11625602131200. Its totient is φ = 10419445892880.
The previous prime is 11021313011287. The next prime is 11021313011383. The reversal of 11021313011321 is 12311031312011.
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 11021313011321 - 26 = 11021313011257 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11021313011293 and 11021313011302.
It is not an unprimeable number, because it can be changed into a prime (11021313011521) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 605491010 + ... + 605509211.
It is an arithmetic number, because the mean of its divisors is an integer number (1453200266400).
Almost surely, 211021313011321 is an apocalyptic number.
It is an amenable number.
11021313011321 is a deficient number, since it is larger than the sum of its proper divisors (604289119879).
11021313011321 is a wasteful number, since it uses less digits than its factorization.
11021313011321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1211000719.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 11021313011321 its reverse (12311031312011), we get a palindrome (23332344323332).
The spelling of 11021313011321 in words is "eleven trillion, twenty-one billion, three hundred thirteen million, eleven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •