Base | Representation |
---|---|
bin | 111100011100111… |
… | …100100101010101 |
3 | 2121200102202211222 |
4 | 330130330211111 |
5 | 4034120034031 |
6 | 244350140125 |
7 | 34063510643 |
oct | 7434744525 |
9 | 2550382758 |
10 | 1014221141 |
11 | 48055739a |
12 | 2437b1645 |
13 | 13217916b |
14 | 989b0193 |
15 | 5e08ee7b |
hex | 3c73c955 |
1014221141 has 12 divisors (see below), whose sum is σ = 1073595852. Its totient is φ = 957528000.
The previous prime is 1014221119. The next prime is 1014221149. The reversal of 1014221141 is 1411224101.
It can be written as a sum of positive squares in 2 ways, for example, as 334524100 + 679697041 = 18290^2 + 26071^2 .
It is not a de Polignac number, because 1014221141 - 210 = 1014220117 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 (1014221149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 26531 + ... + 52271.
It is an arithmetic number, because the mean of its divisors is an integer number (89466321).
Almost surely, 21014221141 is an apocalyptic number.
It is an amenable number.
1014221141 is a deficient number, since it is larger than the sum of its proper divisors (59374711).
1014221141 is an equidigital number, since it uses as much as digits as its factorization.
1014221141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25844 (or 25813 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
The square root of 1014221141 is about 31846.8387913149. The cubic root of 1014221141 is about 1004.7180849986.
Adding to 1014221141 its reverse (1411224101), we get a palindrome (2425445242).
The spelling of 1014221141 in words is "one billion, fourteen million, two hundred twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •