Base | Representation |
---|---|
bin | 1100011011111… |
… | …0111010011011 |
3 | 10122011010002110 |
4 | 3012332322123 |
5 | 101323142303 |
6 | 5102003403 |
7 | 1202241252 |
oct | 306767233 |
9 | 118133073 |
10 | 52162203 |
11 | 27498265 |
12 | 15576563 |
13 | aa64612 |
14 | 6cdb799 |
15 | 48a5703 |
hex | 31bee9b |
52162203 has 4 divisors (see below), whose sum is σ = 69549608. Its totient is φ = 34774800.
The previous prime is 52162189. The next prime is 52162217. The reversal of 52162203 is 30226125.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (52162189) and next prime (52162217).
It is not a de Polignac number, because 52162203 - 212 = 52158107 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 52162203.
It is not an unprimeable number, because it can be changed into a prime (52162003) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 8693698 + ... + 8693703.
It is an arithmetic number, because the mean of its divisors is an integer number (17387402).
Almost surely, 252162203 is an apocalyptic number.
52162203 is a deficient number, since it is larger than the sum of its proper divisors (17387405).
52162203 is a wasteful number, since it uses less digits than its factorization.
52162203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17387404.
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 52162203 is about 7222.3405486033. The cubic root of 52162203 is about 373.6388054881.
Adding to 52162203 its reverse (30226125), we get a palindrome (82388328).
The spelling of 52162203 in words is "fifty-two million, one hundred sixty-two thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •