Base | Representation |
---|---|
bin | 1010001101001110010101… |
… | …0100110010101010011011 |
3 | 1110201211201112002212010121 |
4 | 2203103211110302222123 |
5 | 2432331233303310021 |
6 | 35511242051054111 |
7 | 2235533051116561 |
oct | 243234524625233 |
9 | 43654645085117 |
10 | 11222302010011 |
11 | 3637395a13344 |
12 | 1312b5a2a1337 |
13 | 635349017b51 |
14 | 2ab23b571a31 |
15 | 146db7a16741 |
hex | a34e5532a9b |
11222302010011 has 8 divisors (see below), whose sum is σ = 11572149260448. Its totient is φ = 10876080120000.
The previous prime is 11222302009987. The next prime is 11222302010021. The reversal of 11222302010011 is 11001020322211.
11222302010011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11222302010011 - 225 = 11222268455579 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11222302010021) 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, 906333820 + ... + 906346201.
It is an arithmetic number, because the mean of its divisors is an integer number (1446518657556).
Almost surely, 211222302010011 is an apocalyptic number.
11222302010011 is a deficient number, since it is larger than the sum of its proper divisors (349847250437).
11222302010011 is a wasteful number, since it uses less digits than its factorization.
11222302010011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1812680213.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 11222302010011 its reverse (11001020322211), we get a palindrome (22223322332222).
The spelling of 11222302010011 in words is "eleven trillion, two hundred twenty-two billion, three hundred two million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •