Base | Representation |
---|---|
bin | 1010000111000111000101… |
… | …01001011010111011110100 |
3 | 2220201121021020121011010210 |
4 | 11003203202221122323310 |
5 | 10403242331111430030 |
6 | 115142225052545420 |
7 | 4453251646065003 |
oct | 503434251327364 |
9 | 86647236534123 |
10 | 22234553233140 |
11 | 70a2691712546 |
12 | 25b1256a82270 |
13 | c5392b653a51 |
14 | 56c22dc3cc3a |
15 | 288589a17bb0 |
hex | 1438e2a5aef4 |
22234553233140 has 96 divisors (see below), whose sum is σ = 63315765596160. Its totient is φ = 5828367597696.
The previous prime is 22234553233121. The next prime is 22234553233157. The reversal of 22234553233140 is 4133235543222.
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 61355157 + ... + 61716483.
It is an arithmetic number, because the mean of its divisors is an integer number (659539224960).
Almost surely, 222234553233140 is an apocalyptic number.
22234553233140 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22234553233140 is an abundant number, since it is smaller than the sum of its proper divisors (41081212363020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22234553233140 is a wasteful number, since it uses less digits than its factorization.
22234553233140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 378781 (or 378779 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 39.
Adding to 22234553233140 its reverse (4133235543222), we get a palindrome (26367788776362).
The spelling of 22234553233140 in words is "twenty-two trillion, two hundred thirty-four billion, five hundred fifty-three million, two hundred thirty-three thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •