Base | Representation |
---|---|
bin | 10100100001101101… |
… | …10011101110001010 |
3 | 1001110000111020200021 |
4 | 22100312303232022 |
5 | 140032134040242 |
6 | 5021305331054 |
7 | 540043223065 |
oct | 122066635612 |
9 | 31400436607 |
10 | 11020221322 |
11 | 474569a430 |
12 | 2176796a8a |
13 | 1068187726 |
14 | 7678558dc |
15 | 447735b67 |
hex | 290db3b8a |
11020221322 has 8 divisors (see below), whose sum is σ = 18033089472. Its totient is φ = 5009191500.
The previous prime is 11020221301. The next prime is 11020221343. The reversal of 11020221322 is 22312202011.
It is a happy number.
11020221322 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (11020221301) and next prime (11020221343).
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 = 11020221296 and 11020221305.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 250459554 + ... + 250459597.
It is an arithmetic number, because the mean of its divisors is an integer number (2254136184).
Almost surely, 211020221322 is an apocalyptic number.
11020221322 is a deficient number, since it is larger than the sum of its proper divisors (7012868150).
11020221322 is a wasteful number, since it uses less digits than its factorization.
11020221322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 500919164.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 11020221322 its reverse (22312202011), we get a palindrome (33332423333).
The spelling of 11020221322 in words is "eleven billion, twenty million, two hundred twenty-one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •