Base | Representation |
---|---|
bin | 10100100010111000… |
… | …110110100010000000 |
3 | 2002221102002111200100 |
4 | 110202320312202000 |
5 | 330134400241443 |
6 | 14045001522400 |
7 | 1410446211402 |
oct | 244270664200 |
9 | 62842074610 |
10 | 22060165248 |
11 | 93a042a730 |
12 | 4337aa3400 |
13 | 2107459224 |
14 | 10d3b62b72 |
15 | 891a653d3 |
hex | 522e36880 |
22060165248 has 384 divisors, whose sum is σ = 71013983040. Its totient is φ = 6517555200.
The previous prime is 22060165217. The next prime is 22060165273. The reversal of 22060165248 is 84256106022.
It is a happy number.
22060165248 is a `hidden beast` number, since 2 + 2 + 0 + 601 + 6 + 5 + 2 + 48 = 666.
It is a tau number, because it is divible by the number of its divisors (384).
It is a Harshad number since it is a multiple of its sum of digits (36).
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 47 ways as a sum of consecutive naturals, for example, 161023036 + ... + 161023172.
Almost surely, 222060165248 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 22060165248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (35506991520).
22060165248 is an abundant number, since it is smaller than the sum of its proper divisors (48953817792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22060165248 is a wasteful number, since it uses less digits than its factorization.
22060165248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 396 (or 381 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 36.
The spelling of 22060165248 in words is "twenty-two billion, sixty million, one hundred sixty-five thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •