Base | Representation |
---|---|
bin | 101010001100… |
… | …1101101011010 |
3 | 1112122002100100 |
4 | 1110121231122 |
5 | 21131003102 |
6 | 2110120230 |
7 | 356030355 |
oct | 124315532 |
9 | 45562310 |
10 | 22125402 |
11 | 11542162 |
12 | 74b0076 |
13 | 4778970 |
14 | 2d1d29c |
15 | 1e20a1c |
hex | 1519b5a |
22125402 has 48 divisors (see below), whose sum is σ = 53883648. Its totient is φ = 6510240.
The previous prime is 22125377. The next prime is 22125403. The reversal of 22125402 is 20452122.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (22125403) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 3327 + ... + 7437.
It is an arithmetic number, because the mean of its divisors is an integer number (1122576).
Almost surely, 222125402 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22125402, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26941824).
22125402 is an abundant number, since it is smaller than the sum of its proper divisors (31758246).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22125402 is a wasteful number, since it uses less digits than its factorization.
22125402 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4155 (or 4152 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 18.
The square root of 22125402 is about 4703.7646624805. The cubic root of 22125402 is about 280.7353206522.
Adding to 22125402 its reverse (20452122), we get a palindrome (42577524).
The spelling of 22125402 in words is "twenty-two million, one hundred twenty-five thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •