Base | Representation |
---|---|
bin | 111111010001111… |
… | …0000000111010011 |
3 | 12110222100212212001 |
4 | 1332203300013103 |
5 | 13322031120311 |
6 | 550405414431 |
7 | 103421522614 |
oct | 17643600723 |
9 | 5428325761 |
10 | 2123301331 |
11 | 99a603798 |
12 | 4b310a417 |
13 | 27ab88b28 |
14 | 161dd3c0b |
15 | c661b4c1 |
hex | 7e8f01d3 |
2123301331 has 2 divisors, whose sum is σ = 2123301332. Its totient is φ = 2123301330.
The previous prime is 2123301329. The next prime is 2123301347. The reversal of 2123301331 is 1331033212.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2123301331 - 21 = 2123301329 is a prime.
It is a super-2 number, since 2×21233013312 = 9016817084452743122, which contains 22 as substring.
Together with 2123301329, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 2123301299 and 2123301308.
It is not a weakly prime, because it can be changed into another prime (2123301371) 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, 1061650665 + 1061650666.
It is an arithmetic number, because the mean of its divisors is an integer number (1061650666).
Almost surely, 22123301331 is an apocalyptic number.
2123301331 is a deficient number, since it is larger than the sum of its proper divisors (1).
2123301331 is an equidigital number, since it uses as much as digits as its factorization.
2123301331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 19.
The square root of 2123301331 is about 46079.2939507541. The cubic root of 2123301331 is about 1285.2981348845.
Adding to 2123301331 its reverse (1331033212), we get a palindrome (3454334543).
The spelling of 2123301331 in words is "two billion, one hundred twenty-three million, three hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •