Base | Representation |
---|---|
bin | 10101010111000111… |
… | …111100010010001000 |
3 | 2012012111010202121202 |
4 | 111113013330102020 |
5 | 333433223124300 |
6 | 14311545323332 |
7 | 1441250224634 |
oct | 252707742210 |
9 | 65174122552 |
10 | 22936536200 |
11 | 9800093146 |
12 | 4541496548 |
13 | 2216b9b716 |
14 | 11782cbdc4 |
15 | 8e3975ad5 |
hex | 5571fc488 |
22936536200 has 36 divisors (see below), whose sum is σ = 53332426815. Its totient is φ = 9173757760.
The previous prime is 22936536197. The next prime is 22936536211. The reversal of 22936536200 is 263563922.
It is a happy number.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 5 ways, for example, as 20450716036 + 2485820164 = 143006^2 + 49858^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=107090.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 2136446 + ... + 2147154.
Almost surely, 222936536200 is an apocalyptic number.
22936536200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22936536200 is an abundant number, since it is smaller than the sum of its proper divisors (30395890615).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22936536200 is an frugal number, since it uses more digits than its factorization.
22936536200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21434 (or 10716 counting only the distinct ones).
The product of its (nonzero) digits is 116640, while the sum is 38.
The spelling of 22936536200 in words is "twenty-two billion, nine hundred thirty-six million, five hundred thirty-six thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •