Base | Representation |
---|---|
bin | 110000011111111100001010… |
… | …000101110100101111101011 |
3 | 1000222020101111111120200000122 |
4 | 300133330022011310233223 |
5 | 210424211203302321141 |
6 | 2033353104133353455 |
7 | 62633332564013552 |
oct | 6037741205645753 |
9 | 1028211444520018 |
10 | 213301130120171 |
11 | 61a67557227355 |
12 | 1bb0b230a9888b |
13 | 9203296c41452 |
14 | 3a95b88ccad99 |
15 | 199d6ba21a64b |
hex | c1ff0a174beb |
213301130120171 has 2 divisors, whose sum is σ = 213301130120172. Its totient is φ = 213301130120170.
The previous prime is 213301130120051. The next prime is 213301130120189. The reversal of 213301130120171 is 171021031103312.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 213301130120171 - 218 = 213301129858027 is a prime.
It is a super-2 number, since 2×2133011301201712 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 213301130120171.
It is not a weakly prime, because it can be changed into another prime (213301130120191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106650565060085 + 106650565060086.
It is an arithmetic number, because the mean of its divisors is an integer number (106650565060086).
Almost surely, 2213301130120171 is an apocalyptic number.
213301130120171 is a deficient number, since it is larger than the sum of its proper divisors (1).
213301130120171 is an equidigital number, since it uses as much as digits as its factorization.
213301130120171 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 26.
Adding to 213301130120171 its reverse (171021031103312), we get a palindrome (384322161223483).
The spelling of 213301130120171 in words is "two hundred thirteen trillion, three hundred one billion, one hundred thirty million, one hundred twenty thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.205 sec. • engine limits •