Base | Representation |
---|---|
bin | 110000011011101111001100… |
… | …011011001110001011001011 |
3 | 1000221012210001201100100020122 |
4 | 300123233030123032023023 |
5 | 210404443224134430011 |
6 | 2033012303103213455 |
7 | 62603430115513331 |
oct | 6033571433161313 |
9 | 1027183051310218 |
10 | 213012332733131 |
11 | 61966028675a78 |
12 | 1ba832732a728b |
13 | 91b1c90cca909 |
14 | 3a85bcd91bb51 |
15 | 1995e162be3db |
hex | c1bbcc6ce2cb |
213012332733131 has 2 divisors, whose sum is σ = 213012332733132. Its totient is φ = 213012332733130.
The previous prime is 213012332733127. The next prime is 213012332733139. The reversal of 213012332733131 is 131337233210312.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 213012332733131 - 22 = 213012332733127 is a prime.
It is a super-2 number, since 2×2130123327331312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 213012332733091 and 213012332733100.
It is not a weakly prime, because it can be changed into another prime (213012332733139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106506166366565 + 106506166366566.
It is an arithmetic number, because the mean of its divisors is an integer number (106506166366566).
Almost surely, 2213012332733131 is an apocalyptic number.
213012332733131 is a deficient number, since it is larger than the sum of its proper divisors (1).
213012332733131 is an equidigital number, since it uses as much as digits as its factorization.
213012332733131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 40824, while the sum is 35.
Adding to 213012332733131 its reverse (131337233210312), we get a palindrome (344349565943443).
The spelling of 213012332733131 in words is "two hundred thirteen trillion, twelve billion, three hundred thirty-two million, seven hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •