Base | Representation |
---|---|
bin | 10101010110111001… |
… | …111011010010010000 |
3 | 2012012020020002200211 |
4 | 111112321323102100 |
5 | 333431303041341 |
6 | 14311334453504 |
7 | 1441204053154 |
oct | 252671732220 |
9 | 65166202624 |
10 | 22932862096 |
11 | 97a90037a1 |
12 | 4540204294 |
13 | 22161b32b1 |
14 | 1177a13064 |
15 | 8e349c181 |
hex | 556e7b490 |
22932862096 has 75 divisors (see below), whose sum is σ = 47572541503. Its totient is φ = 10709553920.
The previous prime is 22932862093. The next prime is 22932862111. The reversal of 22932862096 is 69026823922.
The square root of 22932862096 is 151436.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 2 ways, for example, as 7117284496 + 15815577600 = 84364^2 + 125760^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22932862093) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 175059951 + ... + 175060081.
Almost surely, 222932862096 is an apocalyptic number.
22932862096 is the 151436-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22932862096
22932862096 is an abundant number, since it is smaller than the sum of its proper divisors (24639679407).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22932862096 is an frugal number, since it uses more digits than its factorization.
22932862096 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 338 (or 150 counting only the distinct ones).
The product of its (nonzero) digits is 1119744, while the sum is 49.
Multiplying 22932862096 by its sum of digits (49), we get a square (1123710242704 = 10600522).
The spelling of 22932862096 in words is "twenty-two billion, nine hundred thirty-two million, eight hundred sixty-two thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •