Base | Representation |
---|---|
bin | 1010000110110100011010… |
… | …10101100010000100011100 |
3 | 2220200122101211220212011022 |
4 | 11003122031111202010130 |
5 | 10403111320144142112 |
6 | 115133450431343312 |
7 | 4452445423146431 |
oct | 503321525420434 |
9 | 86618354825138 |
10 | 22224532021532 |
11 | 7099409a2a985 |
12 | 25ab31a981b38 |
13 | c529c244a839 |
14 | 56b95cd57b88 |
15 | 28819ed69d72 |
hex | 14368d56211c |
22224532021532 has 12 divisors (see below), whose sum is σ = 39008340330960. Its totient is φ = 11079291926976.
The previous prime is 22224532021529. The next prime is 22224532021541. The reversal of 22224532021532 is 23512023542222.
It is a super-2 number, since 2×222245320215322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22224532021492 and 22224532021501.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8243519432 + ... + 8243522127.
It is an arithmetic number, because the mean of its divisors is an integer number (3250695027580).
Almost surely, 222224532021532 is an apocalyptic number.
It is an amenable number.
22224532021532 is a deficient number, since it is larger than the sum of its proper divisors (16783808309428).
22224532021532 is a wasteful number, since it uses less digits than its factorization.
22224532021532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16487041900 (or 16487041898 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 35.
Adding to 22224532021532 its reverse (23512023542222), we get a palindrome (45736555563754).
The spelling of 22224532021532 in words is "twenty-two trillion, two hundred twenty-four billion, five hundred thirty-two million, twenty-one thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •