Base | Representation |
---|---|
bin | 1010000000111111101110… |
… | …0001101110100011110010 |
3 | 1102222202110121211000000202 |
4 | 2200033323201232203302 |
5 | 2420411012100233242 |
6 | 35230540004115202 |
7 | 2214415050634256 |
oct | 240177341564362 |
9 | 42882417730022 |
10 | 11012221102322 |
11 | 35662907a6a80 |
12 | 129a2aa695b02 |
13 | 61b5a9320c4b |
14 | 2a0dcc6aa266 |
15 | 1416be551932 |
hex | a03fb86e8f2 |
11012221102322 has 8 divisors (see below), whose sum is σ = 18019998167472. Its totient is φ = 5005555046500.
The previous prime is 11012221102319. The next prime is 11012221102349. The reversal of 11012221102322 is 22320112221011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 11012221102294 and 11012221102303.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 250277752304 + ... + 250277752347.
It is an arithmetic number, because the mean of its divisors is an integer number (2252499770934).
Almost surely, 211012221102322 is an apocalyptic number.
11012221102322 is a deficient number, since it is larger than the sum of its proper divisors (7007777065150).
11012221102322 is a wasteful number, since it uses less digits than its factorization.
11012221102322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 500555504664.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 11012221102322 its reverse (22320112221011), we get a palindrome (33332333323333).
The spelling of 11012221102322 in words is "eleven trillion, twelve billion, two hundred twenty-one million, one hundred two thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •