Base | Representation |
---|---|
bin | 1100011011000… |
… | …0000001100111 |
3 | 10122001000102221 |
4 | 3012300001213 |
5 | 101314214343 |
6 | 5100413211 |
7 | 1201565416 |
oct | 306600147 |
9 | 118030387 |
10 | 52101223 |
11 | 27456469 |
12 | 15547207 |
13 | aa42935 |
14 | 6cc347d |
15 | 48925ed |
hex | 31b0067 |
52101223 has 8 divisors (see below), whose sum is σ = 52831440. Its totient is φ = 51374400.
The previous prime is 52101193. The next prime is 52101227. The reversal of 52101223 is 32210125.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 52101223 - 213 = 52093031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 52101197 and 52101206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52101227) 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 7 ways as a sum of consecutive naturals, for example, 49048 + ... + 50098.
It is an arithmetic number, because the mean of its divisors is an integer number (6603930).
Almost surely, 252101223 is an apocalyptic number.
52101223 is a deficient number, since it is larger than the sum of its proper divisors (730217).
52101223 is a wasteful number, since it uses less digits than its factorization.
52101223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1697.
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 52101223 is about 7218.1176909219. The cubic root of 52101223 is about 373.4931484317.
Adding to 52101223 its reverse (32210125), we get a palindrome (84311348).
It can be divided in two parts, 5210122 and 3, that added together give a palindrome (5210125).
The spelling of 52101223 in words is "fifty-two million, one hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •