Base | Representation |
---|---|
bin | 100100011001100… |
… | …0000010100100101 |
3 | 10011010011000002100 |
4 | 1020303000110211 |
5 | 10000130031323 |
6 | 321105202313 |
7 | 42160064325 |
oct | 11063002445 |
9 | 3133130070 |
10 | 1221330213 |
11 | 577455514 |
12 | 2a1030399 |
13 | 1660521cc |
14 | b82c3285 |
15 | 72350943 |
hex | 48cc0525 |
1221330213 has 6 divisors (see below), whose sum is σ = 1764143654. Its totient is φ = 814220136.
The previous prime is 1221330211. The next prime is 1221330217. The reversal of 1221330213 is 3120331221.
1221330213 is a `hidden beast` number, since 122 + 1 + 330 + 213 = 666.
It can be written as a sum of positive squares in only one way, i.e., 835325604 + 386004609 = 28902^2 + 19647^2 .
It is not a de Polignac number, because 1221330213 - 21 = 1221330211 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1221330211) 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 5 ways as a sum of consecutive naturals, for example, 67851670 + ... + 67851687.
Almost surely, 21221330213 is an apocalyptic number.
It is an amenable number.
1221330213 is a deficient number, since it is larger than the sum of its proper divisors (542813441).
1221330213 is a wasteful number, since it uses less digits than its factorization.
1221330213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135703363 (or 135703360 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
The square root of 1221330213 is about 34947.5351491346. The cubic root of 1221330213 is about 1068.9179421320.
Adding to 1221330213 its reverse (3120331221), we get a palindrome (4341661434).
The spelling of 1221330213 in words is "one billion, two hundred twenty-one million, three hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •