Base | Representation |
---|---|
bin | 1100011101100… |
… | …1010000011001 |
3 | 10122100121002211 |
4 | 3013121100121 |
5 | 101340120410 |
6 | 5104155121 |
7 | 1203200656 |
oct | 307312031 |
9 | 118317084 |
10 | 52270105 |
11 | 27561338 |
12 | 15608aa1 |
13 | aaa1774 |
14 | 6d28c2d |
15 | 48c768a |
hex | 31d9419 |
52270105 has 4 divisors (see below), whose sum is σ = 62724132. Its totient is φ = 41816080.
The previous prime is 52270103. The next prime is 52270111. The reversal of 52270105 is 50107225.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 18071001 + 34199104 = 4251^2 + 5848^2 .
It is not a de Polignac number, because 52270105 - 21 = 52270103 is a prime.
It is a super-2 number, since 2×522701052 = 5464327753422050, which contains 22 as substring.
It is a Smith number, since the sum of its digits (22) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (52270103) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5227006 + ... + 5227015.
It is an arithmetic number, because the mean of its divisors is an integer number (15681033).
Almost surely, 252270105 is an apocalyptic number.
It is an amenable number.
52270105 is a deficient number, since it is larger than the sum of its proper divisors (10454027).
52270105 is a wasteful number, since it uses less digits than its factorization.
52270105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10454026.
The product of its (nonzero) digits is 700, while the sum is 22.
The square root of 52270105 is about 7229.8067055766. The cubic root of 52270105 is about 373.8962627060.
The spelling of 52270105 in words is "fifty-two million, two hundred seventy thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •