Base | Representation |
---|---|
bin | 111111001100111… |
… | …1010101011000101 |
3 | 12110210111220020112 |
4 | 1332121322223011 |
5 | 13320401120031 |
6 | 550234242405 |
7 | 103360564205 |
oct | 17631725305 |
9 | 5423456215 |
10 | 2120723141 |
11 | 999102759 |
12 | 4b2286405 |
13 | 27a495484 |
14 | 161922405 |
15 | c62ac62b |
hex | 7e67aac5 |
2120723141 has 2 divisors, whose sum is σ = 2120723142. Its totient is φ = 2120723140.
The previous prime is 2120723131. The next prime is 2120723161. The reversal of 2120723141 is 1413270212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1907855041 + 212868100 = 43679^2 + 14590^2 .
It is a cyclic number.
It is not a de Polignac number, because 2120723141 - 230 = 1046981317 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2120723131) 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 as a sum of consecutive naturals, namely, 1060361570 + 1060361571.
It is an arithmetic number, because the mean of its divisors is an integer number (1060361571).
Almost surely, 22120723141 is an apocalyptic number.
It is an amenable number.
2120723141 is a deficient number, since it is larger than the sum of its proper divisors (1).
2120723141 is an equidigital number, since it uses as much as digits as its factorization.
2120723141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 23.
The square root of 2120723141 is about 46051.3098727930. The cubic root of 2120723141 is about 1284.7777055452. Note that the first 4 decimals are identical.
Adding to 2120723141 its reverse (1413270212), we get a palindrome (3533993353).
The spelling of 2120723141 in words is "two billion, one hundred twenty million, seven hundred twenty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •