Base | Representation |
---|---|
bin | 110000100000010111010000… |
… | …000110100011001110111011 |
3 | 1000222100011120222002110000022 |
4 | 300200113100012203032323 |
5 | 210430200243313100011 |
6 | 2033414315005401055 |
7 | 62635412525646062 |
oct | 6040272006431673 |
9 | 1028304528073008 |
10 | 213330222003131 |
11 | 61a789258a4632 |
12 | 1bb149ab86918b |
13 | 9205c5212a38c |
14 | 3a973488a51d9 |
15 | 199e31e2628db |
hex | c205d01a33bb |
213330222003131 has 2 divisors, whose sum is σ = 213330222003132. Its totient is φ = 213330222003130.
The previous prime is 213330222003103. The next prime is 213330222003149. The reversal of 213330222003131 is 131300222033312.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-213330222003131 is a prime.
It is a super-2 number, since 2×2133302220031312 (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 213330222003131.
It is not a weakly prime, because it can be changed into another prime (213330222003181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106665111001565 + 106665111001566.
It is an arithmetic number, because the mean of its divisors is an integer number (106665111001566).
Almost surely, 2213330222003131 is an apocalyptic number.
213330222003131 is a deficient number, since it is larger than the sum of its proper divisors (1).
213330222003131 is an equidigital number, since it uses as much as digits as its factorization.
213330222003131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 213330222003131 its reverse (131300222033312), we get a palindrome (344630444036443).
The spelling of 213330222003131 in words is "two hundred thirteen trillion, three hundred thirty billion, two hundred twenty-two million, three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •