Base | Representation |
---|---|
bin | 1100010011100… |
… | …01001110010101 |
3 | 21012020100000000 |
4 | 12021301032111 |
5 | 202411133323 |
6 | 14124241513 |
7 | 2362251141 |
oct | 611611625 |
9 | 235210000 |
10 | 103224213 |
11 | 532a3974 |
12 | 2a6a0299 |
13 | 18502221 |
14 | d9d0221 |
15 | 90dee43 |
hex | 6271395 |
103224213 has 18 divisors (see below), whose sum is σ = 154838294. Its totient is φ = 68811768.
The previous prime is 103224211. The next prime is 103224223. The reversal of 103224213 is 312422301.
It can be written as a sum of positive squares in only one way, i.e., 68260644 + 34963569 = 8262^2 + 5913^2 .
It is not a de Polignac number, because 103224213 - 21 = 103224211 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103224211) 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 17 ways as a sum of consecutive naturals, for example, 1306 + ... + 14427.
Almost surely, 2103224213 is an apocalyptic number.
It is an amenable number.
103224213 is a deficient number, since it is larger than the sum of its proper divisors (51614081).
103224213 is an frugal number, since it uses more digits than its factorization.
103224213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15757 (or 15736 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
The square root of 103224213 is about 10159.9317418967. The cubic root of 103224213 is about 469.0947006982.
Adding to 103224213 its reverse (312422301), we get a palindrome (415646514).
It can be divided in two parts, 10322 and 4213, that added together give a triangular number (14535 = T170).
The spelling of 103224213 in words is "one hundred three million, two hundred twenty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •