Base | Representation |
---|---|
bin | 111111001101100… |
… | …1000011000001111 |
3 | 12110211010001211202 |
4 | 1332123020120033 |
5 | 13320441311143 |
6 | 550245140115 |
7 | 103363361144 |
oct | 17633103017 |
9 | 5424101752 |
10 | 2121041423 |
11 | 9992aa8a6 |
12 | 4b23ba63b |
13 | 27a5772c7 |
14 | 1619a63cb |
15 | c6321ab8 |
hex | 7e6c860f |
2121041423 has 2 divisors, whose sum is σ = 2121041424. Its totient is φ = 2121041422.
The previous prime is 2121041413. The next prime is 2121041443. The reversal of 2121041423 is 3241401212.
It is an a-pointer prime, because the next prime (2121041443) can be obtained adding 2121041423 to its sum of digits (20).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2121041423 - 212 = 2121037327 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2121041395 and 2121041404.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2121041413) 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 as a sum of consecutive naturals, namely, 1060520711 + 1060520712.
It is an arithmetic number, because the mean of its divisors is an integer number (1060520712).
Almost surely, 22121041423 is an apocalyptic number.
2121041423 is a deficient number, since it is larger than the sum of its proper divisors (1).
2121041423 is an equidigital number, since it uses as much as digits as its factorization.
2121041423 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 20.
The square root of 2121041423 is about 46054.7654754641. The cubic root of 2121041423 is about 1284.8419762578.
Adding to 2121041423 its reverse (3241401212), we get a palindrome (5362442635).
The spelling of 2121041423 in words is "two billion, one hundred twenty-one million, forty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •