Base | Representation |
---|---|
bin | 1010001001101000000111… |
… | …11100000011010011011100 |
3 | 2221000212102122100102100010 |
4 | 11010310003330003103130 |
5 | 10411201412321024012 |
6 | 115250044141203220 |
7 | 4462432314655146 |
oct | 504640374032334 |
9 | 87025378312303 |
10 | 22321011111132 |
11 | 7126318956978 |
12 | 2605b65560510 |
13 | c5bb2967c036 |
14 | 5724b2535c96 |
15 | 28a949e16c3c |
hex | 144d03f034dc |
22321011111132 has 24 divisors (see below), whose sum is σ = 55146027451536. Its totient is φ = 7002670152448.
The previous prime is 22321011111043. The next prime is 22321011111209. The reversal of 22321011111132 is 23111111012322.
It is a super-3 number, since 3×223210111111323 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22321011111099 and 22321011111108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54708360363 + ... + 54708360770.
It is an arithmetic number, because the mean of its divisors is an integer number (2297751143814).
Almost surely, 222321011111132 is an apocalyptic number.
It is an amenable number.
22321011111132 is an abundant number, since it is smaller than the sum of its proper divisors (32825016340404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22321011111132 is a wasteful number, since it uses less digits than its factorization.
22321011111132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 109416721157 (or 109416721155 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 22321011111132 its reverse (23111111012322), we get a palindrome (45432122123454).
The spelling of 22321011111132 in words is "twenty-two trillion, three hundred twenty-one billion, eleven million, one hundred eleven thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •