Base | Representation |
---|---|
bin | 101010000110… |
… | …0000110111100 |
3 | 1112112020221000 |
4 | 1110030012330 |
5 | 21122212232 |
6 | 2105010300 |
7 | 355406061 |
oct | 124140674 |
9 | 45466830 |
10 | 22069692 |
11 | 11504317 |
12 | 7483990 |
13 | 47594b8 |
14 | 2d06c68 |
15 | 1e0e27c |
hex | 150c1bc |
22069692 has 48 divisors (see below), whose sum is σ = 57584800. Its totient is φ = 7309440.
The previous prime is 22069687. The next prime is 22069693. The reversal of 22069692 is 29696022.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22069693) by changing a digit.
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, 18984 + ... + 20112.
Almost surely, 222069692 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 22069692, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28792400).
22069692 is an abundant number, since it is smaller than the sum of its proper divisors (35515108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22069692 is a wasteful number, since it uses less digits than its factorization.
22069692 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1323 (or 1315 counting only the distinct ones).
The product of its (nonzero) digits is 23328, while the sum is 36.
The square root of 22069692 is about 4697.8390777037. The cubic root of 22069692 is about 280.4994995559.
The spelling of 22069692 in words is "twenty-two million, sixty-nine thousand, six hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •