Base | Representation |
---|---|
bin | 101011001111… |
… | …0000100110000 |
3 | 1120122122001120 |
4 | 1112132010300 |
5 | 21300330233 |
6 | 2125502240 |
7 | 363446130 |
oct | 126360460 |
9 | 46578046 |
10 | 22667568 |
11 | 11882530 |
12 | 7711980 |
13 | 4908681 |
14 | 3020ac0 |
15 | 1ecb4b3 |
hex | 159e130 |
22667568 has 80 divisors (see below), whose sum is σ = 73019136. Its totient is φ = 5886720.
The previous prime is 22667543. The next prime is 22667573. The reversal of 22667568 is 86576622.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 630 + ... + 6762.
Almost surely, 222667568 is an apocalyptic number.
22667568 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22667568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36509568).
22667568 is an abundant number, since it is smaller than the sum of its proper divisors (50351568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22667568 is a wasteful number, since it uses less digits than its factorization.
22667568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6162 (or 6156 counting only the distinct ones).
The product of its digits is 241920, while the sum is 42.
The square root of 22667568 is about 4761.0469436879. The cubic root of 22667568 is about 283.0099094617.
It can be divided in two parts, 22 and 667568, that added together give a triangular number (667590 = T1155).
The spelling of 22667568 in words is "twenty-two million, six hundred sixty-seven thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •