Base | Representation |
---|---|
bin | 100100010111011… |
… | …0110001100001101 |
3 | 10011001002121210022 |
4 | 1020232312030031 |
5 | 4444340141031 |
6 | 321025551525 |
7 | 42144604301 |
oct | 11056661415 |
9 | 3131077708 |
10 | 1220240141 |
11 | 57688052a |
12 | 2a07a55a5 |
13 | 165a5ccb3 |
14 | b80bbd01 |
15 | 721d797b |
hex | 48bb630d |
1220240141 has 4 divisors (see below), whose sum is σ = 1220316192. Its totient is φ = 1220164092.
The previous prime is 1220240071. The next prime is 1220240143. The reversal of 1220240141 is 1410420221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1220240141 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220240143) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3521 + ... + 49526.
It is an arithmetic number, because the mean of its divisors is an integer number (305079048).
Almost surely, 21220240141 is an apocalyptic number.
It is an amenable number.
1220240141 is a deficient number, since it is larger than the sum of its proper divisors (76051).
1220240141 is an equidigital number, since it uses as much as digits as its factorization.
1220240141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76050.
The product of its (nonzero) digits is 128, while the sum is 17.
The square root of 1220240141 is about 34931.9358324156. The cubic root of 1220240141 is about 1068.5998342373.
Adding to 1220240141 its reverse (1410420221), we get a palindrome (2630660362).
The spelling of 1220240141 in words is "one billion, two hundred twenty million, two hundred forty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •