Base | Representation |
---|---|
bin | 11010010110100… |
… | …10110010100001 |
3 | 120101222020021122 |
4 | 31023102302201 |
5 | 423043024403 |
6 | 33534102025 |
7 | 5323005326 |
oct | 1513226241 |
9 | 511866248 |
10 | 221064353 |
11 | 10386aa14 |
12 | 6204a915 |
13 | 36a51013 |
14 | 21506b4d |
15 | 1461a838 |
hex | d2d2ca1 |
221064353 has 4 divisors (see below), whose sum is σ = 221263380. Its totient is φ = 220865328.
The previous prime is 221064301. The next prime is 221064377. The reversal of 221064353 is 353460122.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 353460122 = 2 ⋅176730061.
It can be written as a sum of positive squares in 2 ways, for example, as 19651489 + 201412864 = 4433^2 + 14192^2 .
It is a cyclic number.
It is not a de Polignac number, because 221064353 - 28 = 221064097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (221064553) 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 3 ways as a sum of consecutive naturals, for example, 97838 + ... + 100071.
It is an arithmetic number, because the mean of its divisors is an integer number (55315845).
Almost surely, 2221064353 is an apocalyptic number.
It is an amenable number.
221064353 is a deficient number, since it is larger than the sum of its proper divisors (199027).
221064353 is a wasteful number, since it uses less digits than its factorization.
221064353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 199026.
The product of its (nonzero) digits is 4320, while the sum is 26.
The square root of 221064353 is about 14868.2330153922. The cubic root of 221064353 is about 604.6530378591.
The spelling of 221064353 in words is "two hundred twenty-one million, sixty-four thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •