Base | Representation |
---|---|
bin | 11110111111101110100… |
… | …011111100000111100101 |
3 | 21112121221010212122002222 |
4 | 132333232203330013211 |
5 | 234344230332211323 |
6 | 4310302540242125 |
7 | 306613443362165 |
oct | 36775643740745 |
9 | 7477833778088 |
10 | 2130011210213 |
11 | 751372887357 |
12 | 2a4988540345 |
13 | 125b22862563 |
14 | 751436365a5 |
15 | 3a616d079c8 |
hex | 1efee8fc1e5 |
2130011210213 has 2 divisors, whose sum is σ = 2130011210214. Its totient is φ = 2130011210212.
The previous prime is 2130011210183. The next prime is 2130011210237. The reversal of 2130011210213 is 3120121100312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1261540051489 + 868471158724 = 1123183^2 + 931918^2 .
It is a cyclic number.
It is not a de Polignac number, because 2130011210213 - 218 = 2130010948069 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2130011210191 and 2130011210200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2130011210293) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1065005605106 + 1065005605107.
It is an arithmetic number, because the mean of its divisors is an integer number (1065005605107).
Almost surely, 22130011210213 is an apocalyptic number.
It is an amenable number.
2130011210213 is a deficient number, since it is larger than the sum of its proper divisors (1).
2130011210213 is an equidigital number, since it uses as much as digits as its factorization.
2130011210213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 2130011210213 its reverse (3120121100312), we get a palindrome (5250132310525).
The spelling of 2130011210213 in words is "two trillion, one hundred thirty billion, eleven million, two hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •