Base | Representation |
---|---|
bin | 11110111111110100011… |
… | …101110100001110001101 |
3 | 21112122012001021022021001 |
4 | 132333310131310032031 |
5 | 234344431212041201 |
6 | 4310320435340301 |
7 | 306616055352241 |
oct | 36776435641615 |
9 | 7478161238231 |
10 | 2130110268301 |
11 | 751413795144 |
12 | 2a49b5751691 |
13 | 125b3a236402 |
14 | 75152860421 |
15 | 3a620873301 |
hex | 1eff477438d |
2130110268301 has 2 divisors, whose sum is σ = 2130110268302. Its totient is φ = 2130110268300.
The previous prime is 2130110268239. The next prime is 2130110268317. The reversal of 2130110268301 is 1038620110312.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2002465557225 + 127644711076 = 1415085^2 + 357274^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2130110268301 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2130110268301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2130110268331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1065055134150 + 1065055134151.
It is an arithmetic number, because the mean of its divisors is an integer number (1065055134151).
Almost surely, 22130110268301 is an apocalyptic number.
It is an amenable number.
2130110268301 is a deficient number, since it is larger than the sum of its proper divisors (1).
2130110268301 is an equidigital number, since it uses as much as digits as its factorization.
2130110268301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 28.
Adding to 2130110268301 its reverse (1038620110312), we get a palindrome (3168730378613).
The spelling of 2130110268301 in words is "two trillion, one hundred thirty billion, one hundred ten million, two hundred sixty-eight thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •