Base | Representation |
---|---|
bin | 111110001110100… |
… | …111111111100101 |
3 | 2200202111202212122 |
4 | 332032213333211 |
5 | 4114232134341 |
6 | 251332555325 |
7 | 34605014435 |
oct | 7616477745 |
9 | 2622452778 |
10 | 1044021221 |
11 | 496360661 |
12 | 251782b45 |
13 | 1383b1149 |
14 | 9c92a2c5 |
15 | 619c994b |
hex | 3e3a7fe5 |
1044021221 has 8 divisors (see below), whose sum is σ = 1153497024. Its totient is φ = 939885760.
The previous prime is 1044021217. The next prime is 1044021229. The reversal of 1044021221 is 1221204401.
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 1044021221 - 22 = 1044021217 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1044021221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1044021229) 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, 1334675 + ... + 1335456.
It is an arithmetic number, because the mean of its divisors is an integer number (144187128).
Almost surely, 21044021221 is an apocalyptic number.
It is an amenable number.
1044021221 is a deficient number, since it is larger than the sum of its proper divisors (109475803).
1044021221 is a wasteful number, since it uses less digits than its factorization.
1044021221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2670171.
The product of its (nonzero) digits is 128, while the sum is 17.
The square root of 1044021221 is about 32311.3172278692. The cubic root of 1044021221 is about 1014.4635378449.
Adding to 1044021221 its reverse (1221204401), we get a palindrome (2265225622).
The spelling of 1044021221 in words is "one billion, forty-four million, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •