Base | Representation |
---|---|
bin | 1010000001110110000110… |
… | …11010101110110011110000 |
3 | 2220002022022010200022222111 |
4 | 11000323003122232303300 |
5 | 10342311324002143011 |
6 | 114523145212415104 |
7 | 4434215526441250 |
oct | 500730332566360 |
9 | 86068263608874 |
10 | 22053640662256 |
11 | 7032995242355 |
12 | 2582187777494 |
13 | c3c859934038 |
14 | 56358ab73960 |
15 | 2839ec14d121 |
hex | 140ec36aecf0 |
22053640662256 has 160 divisors (see below), whose sum is σ = 51007159082880. Its totient is φ = 9037511884800.
The previous prime is 22053640662247. The next prime is 22053640662289. The reversal of 22053640662256 is 65226604635022.
It is a super-2 number, since 2×220536406622562 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 141603180 + ... + 141758836.
It is an arithmetic number, because the mean of its divisors is an integer number (318794744268).
Almost surely, 222053640662256 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22053640662256, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25503579541440).
22053640662256 is an abundant number, since it is smaller than the sum of its proper divisors (28953518420624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22053640662256 is a wasteful number, since it uses less digits than its factorization.
22053640662256 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 156123 (or 156117 counting only the distinct ones).
The product of its (nonzero) digits is 6220800, while the sum is 49.
The spelling of 22053640662256 in words is "twenty-two trillion, fifty-three billion, six hundred forty million, six hundred sixty-two thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •