Base | Representation |
---|---|
bin | 1010000001100001100111… |
… | …1000000111100110010010 |
3 | 1110000121221202102020012211 |
4 | 2200120121320013212102 |
5 | 2421033130434114442 |
6 | 35235042525542334 |
7 | 2215156406116246 |
oct | 240303170074622 |
9 | 43017852366184 |
10 | 11021320223122 |
11 | 356a12aa39120 |
12 | 12a0009a149aa |
13 | 61c3c94977b1 |
14 | 2a1612d24426 |
15 | 141a532ac617 |
hex | a0619e07992 |
11021320223122 has 8 divisors (see below), whose sum is σ = 18034887637872. Its totient is φ = 5009691010500.
The previous prime is 11021320223041. The next prime is 11021320223153. The reversal of 11021320223122 is 22132202312011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 500969101051 = 11021320223122 / (1 + 1 + 0 + 2 + 1 + 3 + 2 + 0 + 2 + 2 + 3 + 1 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 11021320223093 and 11021320223102.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 250484550504 + ... + 250484550547.
It is an arithmetic number, because the mean of its divisors is an integer number (2254360954734).
Almost surely, 211021320223122 is an apocalyptic number.
11021320223122 is a deficient number, since it is larger than the sum of its proper divisors (7013567414750).
11021320223122 is a wasteful number, since it uses less digits than its factorization.
11021320223122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 500969101064.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 11021320223122 its reverse (22132202312011), we get a palindrome (33153522535133).
The spelling of 11021320223122 in words is "eleven trillion, twenty-one billion, three hundred twenty million, two hundred twenty-three thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •