Base | Representation |
---|---|
bin | 10100100010111001… |
… | …100001111111001000 |
3 | 2002221102102112211122 |
4 | 110202321201333020 |
5 | 330134421440430 |
6 | 14045005414412 |
7 | 1410450552335 |
oct | 244271417710 |
9 | 62842375748 |
10 | 22060343240 |
11 | 93a0541431 |
12 | 4337b6a408 |
13 | 21074bc250 |
14 | 10d3bab98c |
15 | 891a9cee5 |
hex | 522e61fc8 |
22060343240 has 64 divisors (see below), whose sum is σ = 53983283760. Its totient is φ = 8064691200.
The previous prime is 22060343213. The next prime is 22060343293. The reversal of 22060343240 is 4234306022.
It can be written as a sum of positive squares in 8 ways, for example, as 10954134244 + 11106208996 = 104662^2 + 105386^2 .
It is a super-2 number, since 2×220603432402 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26).
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 15 ways as a sum of consecutive naturals, for example, 157499 + ... + 262538.
Almost surely, 222060343240 is an apocalyptic number.
22060343240 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22060343240 is an abundant number, since it is smaller than the sum of its proper divisors (31922940520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22060343240 is a wasteful number, since it uses less digits than its factorization.
22060343240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 420162 (or 420158 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 26.
Adding to 22060343240 its reverse (4234306022), we get a palindrome (26294649262).
The spelling of 22060343240 in words is "twenty-two billion, sixty million, three hundred forty-three thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •