Base | Representation |
---|---|
bin | 10100100010001001… |
… | …101010000111100000 |
3 | 2002220112210222000100 |
4 | 110202021222013200 |
5 | 330123213344012 |
6 | 14043440422400 |
7 | 1410236103504 |
oct | 244211520740 |
9 | 62815728010 |
10 | 22047793632 |
11 | 939444a757 |
12 | 4333917a00 |
13 | 2104a17047 |
14 | 10d2262304 |
15 | 89091e8dc |
hex | 52226a1e0 |
22047793632 has 36 divisors (see below), whose sum is σ = 62698413960. Its totient is φ = 7349264448.
The previous prime is 22047793627. The next prime is 22047793633. The reversal of 22047793632 is 23639774022.
22047793632 is a `hidden beast` number, since 2 + 2 + 0 + 4 + 7 + 7 + 9 + 3 + 632 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×220477936322 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22047793633) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 38277132 + ... + 38277707.
It is an arithmetic number, because the mean of its divisors is an integer number (1741622610).
Almost surely, 222047793632 is an apocalyptic number.
It is an amenable number.
22047793632 is an abundant number, since it is smaller than the sum of its proper divisors (40650620328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22047793632 is a wasteful number, since it uses less digits than its factorization.
22047793632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76554855 (or 76554844 counting only the distinct ones).
The product of its (nonzero) digits is 762048, while the sum is 45.
The spelling of 22047793632 in words is "twenty-two billion, forty-seven million, seven hundred ninety-three thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •