Base | Representation |
---|---|
bin | 1100011001111110001… |
… | …0111011001100110111 |
3 | 202101010101221102002002 |
4 | 3012133202323030313 |
5 | 11442442303131411 |
6 | 241524410205515 |
7 | 21253364134034 |
oct | 3063742731467 |
9 | 671111842062 |
10 | 213130130231 |
11 | 8242a4473a7 |
12 | 35380a2389b |
13 | 171376539c5 |
14 | a45bc4238b |
15 | 582602d33b |
hex | 319f8bb337 |
213130130231 has 2 divisors, whose sum is σ = 213130130232. Its totient is φ = 213130130230.
The previous prime is 213130130203. The next prime is 213130130233. The reversal of 213130130231 is 132031031312.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 213130130231 - 222 = 213125935927 is a prime.
It is a super-2 number, since 2×2131301302312 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 213130130233, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213130130233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106565065115 + 106565065116.
It is an arithmetic number, because the mean of its divisors is an integer number (106565065116).
Almost surely, 2213130130231 is an apocalyptic number.
213130130231 is a deficient number, since it is larger than the sum of its proper divisors (1).
213130130231 is an equidigital number, since it uses as much as digits as its factorization.
213130130231 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 20.
Adding to 213130130231 its reverse (132031031312), we get a palindrome (345161161543).
The spelling of 213130130231 in words is "two hundred thirteen billion, one hundred thirty million, one hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •