Base | Representation |
---|---|
bin | 10100011111111110… |
… | …100001101100101101 |
3 | 2002211000011222011001 |
4 | 110133332201230231 |
5 | 330034344234013 |
6 | 14040055000301 |
7 | 1406314066624 |
oct | 243776415455 |
9 | 62730158131 |
10 | 22011321133 |
11 | 93758a939a |
12 | 4323669091 |
13 | 20ca2b6c99 |
14 | 10cb48a6bb |
15 | 88c617ddd |
hex | 51ffa1b2d |
22011321133 has 4 divisors (see below), whose sum is σ = 22012416540. Its totient is φ = 22010225728.
The previous prime is 22011321121. The next prime is 22011321139. The reversal of 22011321133 is 33112311022.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 13163661289 + 8847659844 = 114733^2 + 94062^2 .
It is a cyclic number.
It is not a de Polignac number, because 22011321133 - 233 = 13421386541 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 22011321133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22011321139) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 516988 + ... + 557941.
It is an arithmetic number, because the mean of its divisors is an integer number (5503104135).
Almost surely, 222011321133 is an apocalyptic number.
It is an amenable number.
22011321133 is a deficient number, since it is larger than the sum of its proper divisors (1095407).
22011321133 is a wasteful number, since it uses less digits than its factorization.
22011321133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1095406.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 22011321133 its reverse (33112311022), we get a palindrome (55123632155).
The spelling of 22011321133 in words is "twenty-two billion, eleven million, three hundred twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •