Base | Representation |
---|---|
bin | 111110000111010… |
… | …011011111001101 |
3 | 2200121220021111120 |
4 | 332013103133031 |
5 | 4113234232341 |
6 | 251223511153 |
7 | 34552502616 |
oct | 7607233715 |
9 | 2617807446 |
10 | 1042102221 |
11 | 49526a906 |
12 | 250bb84b9 |
13 | 137b8b844 |
14 | 9c58ac0d |
15 | 6174b066 |
hex | 3e1d37cd |
1042102221 has 8 divisors (see below), whose sum is σ = 1393938624. Its totient is φ = 692500320.
The previous prime is 1042102199. The next prime is 1042102297. The reversal of 1042102221 is 1222012401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1042102221 - 27 = 1042102093 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1042102221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1042102421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 557536 + ... + 559401.
It is an arithmetic number, because the mean of its divisors is an integer number (174242328).
Almost surely, 21042102221 is an apocalyptic number.
It is an amenable number.
1042102221 is a deficient number, since it is larger than the sum of its proper divisors (351836403).
1042102221 is a wasteful number, since it uses less digits than its factorization.
1042102221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1117251.
The product of its (nonzero) digits is 64, while the sum is 15.
The square root of 1042102221 is about 32281.6080919151. The cubic root of 1042102221 is about 1013.8415998112.
Adding to 1042102221 its reverse (1222012401), we get a palindrome (2264114622).
The spelling of 1042102221 in words is "one billion, forty-two million, one hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •