Base | Representation |
---|---|
bin | 111111110111111… |
… | …0001100010010101 |
3 | 12112100212100222122 |
4 | 1333233301202111 |
5 | 13342131330401 |
6 | 552400505325 |
7 | 104053104155 |
oct | 17757614225 |
9 | 5470770878 |
10 | 2143230101 |
11 | 9aa885551 |
12 | 4b991b245 |
13 | 2820459bc |
14 | 164900765 |
15 | c825621b |
hex | 7fbf1895 |
2143230101 has 2 divisors, whose sum is σ = 2143230102. Its totient is φ = 2143230100.
The previous prime is 2143230073. The next prime is 2143230107. The reversal of 2143230101 is 1010323412.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1346523025 + 796707076 = 36695^2 + 28226^2 .
It is a cyclic number.
It is not a de Polignac number, because 2143230101 - 226 = 2076121237 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a self number, because there is not a number n which added to its sum of digits gives 2143230101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2143230107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1071615050 + 1071615051.
It is an arithmetic number, because the mean of its divisors is an integer number (1071615051).
Almost surely, 22143230101 is an apocalyptic number.
It is an amenable number.
2143230101 is a deficient number, since it is larger than the sum of its proper divisors (1).
2143230101 is an equidigital number, since it uses as much as digits as its factorization.
2143230101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 2143230101 is about 46295.0332217183. The cubic root of 2143230101 is about 1289.3067807610.
Adding to 2143230101 its reverse (1010323412), we get a palindrome (3153553513).
The spelling of 2143230101 in words is "two billion, one hundred forty-three million, two hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •