Base | Representation |
---|---|
bin | 1010000001101000101100… |
… | …1100001001101100100001 |
3 | 1110000210212020121221102121 |
4 | 2200122023030021230201 |
5 | 2421101024123100001 |
6 | 35235555320344241 |
7 | 2215254462032401 |
oct | 240321314115441 |
9 | 43023766557377 |
10 | 11023221300001 |
11 | 356aa1605a339 |
12 | 12a045a615081 |
13 | 61c6402b7561 |
14 | 2a17535cc801 |
15 | 141b1512e6a1 |
hex | a068b309b21 |
11023221300001 has 16 divisors (see below), whose sum is σ = 12050013523968. Its totient is φ = 10038573388800.
The previous prime is 11023221299983. The next prime is 11023221300017. The reversal of 11023221300001 is 10000312232011.
It is a cyclic number.
It is not a de Polignac number, because 11023221300001 - 217 = 11023221168929 is a prime.
It is a super-2 number, since 2×110232213000012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11023221300101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1801776 + ... + 5029198.
It is an arithmetic number, because the mean of its divisors is an integer number (753125845248).
Almost surely, 211023221300001 is an apocalyptic number.
It is an amenable number.
11023221300001 is a deficient number, since it is larger than the sum of its proper divisors (1026792223967).
11023221300001 is a wasteful number, since it uses less digits than its factorization.
11023221300001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3233952.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 11023221300001 its reverse (10000312232011), we get a palindrome (21023533532012).
The spelling of 11023221300001 in words is "eleven trillion, twenty-three billion, two hundred twenty-one million, three hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •