Base | Representation |
---|---|
bin | 1010000010001101001101… |
… | …1000000101011010010010 |
3 | 1110001202011021222110111022 |
4 | 2200203103120011122102 |
5 | 2421231112203303242 |
6 | 35244300034315442 |
7 | 2216052402245450 |
oct | 240432330053222 |
9 | 43052137873438 |
10 | 11033022322322 |
11 | 357409551a490 |
12 | 12a2334a28b82 |
13 | 6205429b7b50 |
14 | 2a20031579d0 |
15 | 141eda7d60d2 |
hex | a08d3605692 |
11033022322322 has 64 divisors (see below), whose sum is σ = 22221103451904. Its totient is φ = 3967786045440.
The previous prime is 11033022322319. The next prime is 11033022322327. The reversal of 11033022322322 is 22322322033011.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a junction number, because it is equal to n+sod(n) for n = 11033022322291 and 11033022322300.
It is not an unprimeable number, because it can be changed into a prime (11033022322327) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 73825178 + ... + 73974474.
It is an arithmetic number, because the mean of its divisors is an integer number (347204741436).
Almost surely, 211033022322322 is an apocalyptic number.
11033022322322 is an abundant number, since it is smaller than the sum of its proper divisors (11188081129582).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11033022322322 is a wasteful number, since it uses less digits than its factorization.
11033022322322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186243.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 11033022322322 its reverse (22322322033011), we get a palindrome (33355344355333).
The spelling of 11033022322322 in words is "eleven trillion, thirty-three billion, twenty-two million, three hundred twenty-two thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •