Base | Representation |
---|---|
bin | 11010011000100… |
… | …01001110111001 |
3 | 120102110020010112 |
4 | 31030101032321 |
5 | 423124220441 |
6 | 33543354105 |
7 | 5325122111 |
oct | 1514211671 |
9 | 512406115 |
10 | 221320121 |
11 | 103a250a0 |
12 | 62152935 |
13 | 36b10569 |
14 | 21572041 |
15 | 1466b4eb |
hex | d3113b9 |
221320121 has 8 divisors (see below), whose sum is σ = 242018688. Its totient is φ = 200718000.
The previous prime is 221320079. The next prime is 221320153. The reversal of 221320121 is 121023122.
It is a happy number.
221320121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 221320121 - 214 = 221303737 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 221320096 and 221320105.
It is not an unprimeable number, because it can be changed into a prime (221320621) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19265 + ... + 28526.
It is an arithmetic number, because the mean of its divisors is an integer number (30252336).
Almost surely, 2221320121 is an apocalyptic number.
It is an amenable number.
221320121 is a deficient number, since it is larger than the sum of its proper divisors (20698567).
221320121 is a wasteful number, since it uses less digits than its factorization.
221320121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48223.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 221320121 is about 14876.8316855438. The cubic root of 221320121 is about 604.8861393542.
Adding to 221320121 its reverse (121023122), we get a palindrome (342343243).
The spelling of 221320121 in words is "two hundred twenty-one million, three hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •