Base | Representation |
---|---|
bin | 111111010010001… |
… | …0010011111011101 |
3 | 12110222122001000020 |
4 | 1332210102133131 |
5 | 13322100122031 |
6 | 550412422353 |
7 | 103422650262 |
oct | 17644223735 |
9 | 5428561006 |
10 | 2123442141 |
11 | 99a69a567 |
12 | 4b31779b9 |
13 | 27ac07c52 |
14 | 16202d269 |
15 | c6648096 |
hex | 7e9127dd |
2123442141 has 4 divisors (see below), whose sum is σ = 2831256192. Its totient is φ = 1415628092.
The previous prime is 2123442127. The next prime is 2123442149. The reversal of 2123442141 is 1412443212.
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.
It is a cyclic number.
It is not a de Polignac number, because 2123442141 - 26 = 2123442077 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2123442149) 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 3 ways as a sum of consecutive naturals, for example, 353907021 + ... + 353907026.
It is an arithmetic number, because the mean of its divisors is an integer number (707814048).
Almost surely, 22123442141 is an apocalyptic number.
It is an amenable number.
2123442141 is a deficient number, since it is larger than the sum of its proper divisors (707814051).
2123442141 is an equidigital number, since it uses as much as digits as its factorization.
2123442141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 707814050.
The product of its digits is 1536, while the sum is 24.
The square root of 2123442141 is about 46080.8218351192. The cubic root of 2123442141 is about 1285.3265464320.
Adding to 2123442141 its reverse (1412443212), we get a palindrome (3535885353).
The spelling of 2123442141 in words is "two billion, one hundred twenty-three million, four hundred forty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •