Base | Representation |
---|---|
bin | 10101010010001010… |
… | …001000100110010100 |
3 | 2011222200101002221021 |
4 | 111102022020212110 |
5 | 333300411143402 |
6 | 14255411530524 |
7 | 1436216130463 |
oct | 252212104624 |
9 | 64880332837 |
10 | 22853224852 |
11 | 9768060097 |
12 | 45195b9a44 |
13 | 220284c073 |
14 | 116b2029da |
15 | 8db4bad37 |
hex | 552288994 |
22853224852 has 36 divisors (see below), whose sum is σ = 42492510900. Its totient is φ = 10752458112.
The previous prime is 22853224847. The next prime is 22853224861. The reversal of 22853224852 is 25842235822.
It can be written as a sum of positive squares in 2 ways, for example, as 2838332176 + 20014892676 = 53276^2 + 141474^2 .
It is a super-2 number, since 2×228532248522 (a number of 22 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (43) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 22853224799 and 22853224808.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 162048 + ... + 268264.
It is an arithmetic number, because the mean of its divisors is an integer number (1180347525).
Almost surely, 222853224852 is an apocalyptic number.
It is an amenable number.
22853224852 is a deficient number, since it is larger than the sum of its proper divisors (19639286048).
22853224852 is a wasteful number, since it uses less digits than its factorization.
22853224852 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106408 (or 106387 counting only the distinct ones).
The product of its digits is 614400, while the sum is 43.
The spelling of 22853224852 in words is "twenty-two billion, eight hundred fifty-three million, two hundred twenty-four thousand, eight hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •