Base | Representation |
---|---|
bin | 1100101011110… |
… | …1111111101110 |
3 | 10201010012022110 |
4 | 3022331333232 |
5 | 102110111042 |
6 | 5140224450 |
7 | 1214152341 |
oct | 312757756 |
9 | 121105273 |
10 | 53207022 |
11 | 28041250 |
12 | 1599b126 |
13 | b03c05b |
14 | 70d0458 |
15 | 4a1009c |
hex | 32bdfee |
53207022 has 32 divisors (see below), whose sum is σ = 117298944. Its totient is φ = 15955200.
The previous prime is 53207017. The next prime is 53207023. The reversal of 53207022 is 22070235.
It is a self number, because there is not a number n which added to its sum of digits gives 53207022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53207023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2247 + ... + 10557.
It is an arithmetic number, because the mean of its divisors is an integer number (3665592).
Almost surely, 253207022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 53207022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (58649472).
53207022 is an abundant number, since it is smaller than the sum of its proper divisors (64091922).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53207022 is a wasteful number, since it uses less digits than its factorization.
53207022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8424.
The product of its (nonzero) digits is 840, while the sum is 21.
The square root of 53207022 is about 7294.3143611994. The cubic root of 53207022 is about 376.1170178637.
Adding to 53207022 its reverse (22070235), we get a palindrome (75277257).
The spelling of 53207022 in words is "fifty-three million, two hundred seven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •