Base | Representation |
---|---|
bin | 1010010010111110110101… |
… | …1010101100001110000110 |
3 | 1111002022001102120010101011 |
4 | 2210233231122230032012 |
5 | 2440441330314201042 |
6 | 40024521514152434 |
7 | 2245634302261213 |
oct | 244575532541606 |
9 | 44068042503334 |
10 | 11321222022022 |
11 | 3675337762490 |
12 | 132a16642271a |
13 | 641781b62633 |
14 | 2b1d42dc2b0a |
15 | 14975701ea17 |
hex | a4bed6ac386 |
11321222022022 has 16 divisors (see below), whose sum is σ = 18546061246272. Its totient is φ = 5140336340520.
The previous prime is 11321222021981. The next prime is 11321222022029. The reversal of 11321222022022 is 22022022212311.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 11321222021984 and 11321222022002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11321222022029) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 283663068 + ... + 283702975.
It is an arithmetic number, because the mean of its divisors is an integer number (1159128827892).
Almost surely, 211321222022022 is an apocalyptic number.
11321222022022 is a deficient number, since it is larger than the sum of its proper divisors (7224839224250).
11321222022022 is a wasteful number, since it uses less digits than its factorization.
11321222022022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 567366963.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 11321222022022 its reverse (22022022212311), we get a palindrome (33343244234333).
The spelling of 11321222022022 in words is "eleven trillion, three hundred twenty-one billion, two hundred twenty-two million, twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •