Base | Representation |
---|---|
bin | 1010000000111000000110… |
… | …10010101001001011111100 |
3 | 2212222010101020012210102111 |
4 | 11000130003102221023330 |
5 | 10341240140222424112 |
6 | 114500002120503404 |
7 | 4431626602222255 |
oct | 500340322511374 |
9 | 85863336183374 |
10 | 22020352545532 |
11 | 701a862a40590 |
12 | 257783761ab64 |
13 | c3968328a753 |
14 | 561b0db63b2c |
15 | 282beea1c5a7 |
hex | 1407034a92fc |
22020352545532 has 12 divisors (see below), whose sum is σ = 42038854859736. Its totient is φ = 10009251157040.
The previous prime is 22020352545431. The next prime is 22020352545533. The reversal of 22020352545532 is 23554525302022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22020352545533) by changing a digit.
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, 250231278883 + ... + 250231278970.
It is an arithmetic number, because the mean of its divisors is an integer number (3503237904978).
Almost surely, 222020352545532 is an apocalyptic number.
22020352545532 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
22020352545532 is a deficient number, since it is larger than the sum of its proper divisors (20018502314204).
22020352545532 is a wasteful number, since it uses less digits than its factorization.
22020352545532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 500462557868 (or 500462557866 counting only the distinct ones).
The product of its (nonzero) digits is 720000, while the sum is 40.
Adding to 22020352545532 its reverse (23554525302022), we get a palindrome (45574877847554).
The spelling of 22020352545532 in words is "twenty-two trillion, twenty billion, three hundred fifty-two million, five hundred forty-five thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •