Base | Representation |
---|---|
bin | 10100101101101010… |
… | …111000001110001100 |
3 | 2010102000110111000100 |
4 | 110231222320032030 |
5 | 331022202122112 |
6 | 14114542531100 |
7 | 1415103550560 |
oct | 245552701614 |
9 | 63360414010 |
10 | 22241051532 |
11 | 9483548227 |
12 | 4388596a90 |
13 | 2135a8062b |
14 | 110dbab6a0 |
15 | 8a28962dc |
hex | 52dab838c |
22241051532 has 144 divisors (see below), whose sum is σ = 64892219392. Its totient is φ = 6291561600.
The previous prime is 22241051473. The next prime is 22241051549. The reversal of 22241051532 is 23515014222.
22241051532 is a `hidden beast` number, since 2 + 2 + 24 + 105 + 1 + 532 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 22241051496 and 22241051505.
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 47 ways as a sum of consecutive naturals, for example, 14192613 + ... + 14194179.
Almost surely, 222241051532 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22241051532, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32446109696).
22241051532 is an abundant number, since it is smaller than the sum of its proper divisors (42651167860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22241051532 is a wasteful number, since it uses less digits than its factorization.
22241051532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2108 (or 2103 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
Adding to 22241051532 its reverse (23515014222), we get a palindrome (45756065754).
The spelling of 22241051532 in words is "twenty-two billion, two hundred forty-one million, fifty-one thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •