Base | Representation |
---|---|
bin | 1010000000111111111100… |
… | …01101101111010011000000 |
3 | 2212222112020121200120020020 |
4 | 11000133332031233103000 |
5 | 10341322300424403211 |
6 | 114501535543213440 |
7 | 4432136121001512 |
oct | 500377615572300 |
9 | 85875217616206 |
10 | 22024562341056 |
11 | 7021623298240 |
12 | 2578611447280 |
13 | c39ba44b5c12 |
14 | 561dcccc9bb2 |
15 | 282d993d4306 |
hex | 1407fe36f4c0 |
22024562341056 has 112 divisors (see below), whose sum is σ = 63638458334208. Its totient is φ = 6667016627200.
The previous prime is 22024562341043. The next prime is 22024562341157. The reversal of 22024562341056 is 65014326542022.
22024562341056 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 22024562340999 and 22024562341017.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3553680 + ... + 7528463.
Almost surely, 222024562341056 is an apocalyptic number.
It is an amenable number.
22024562341056 is an abundant number, since it is smaller than the sum of its proper divisors (41613895993152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22024562341056 is a wasteful number, since it uses less digits than its factorization.
22024562341056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11083110 (or 11083100 counting only the distinct ones).
The product of its (nonzero) digits is 691200, while the sum is 42.
Adding to 22024562341056 its reverse (65014326542022), we get a palindrome (87038888883078).
The spelling of 22024562341056 in words is "twenty-two trillion, twenty-four billion, five hundred sixty-two million, three hundred forty-one thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •