Base | Representation |
---|---|
bin | 110000011011101111111010… |
… | …111100001101100010101101 |
3 | 1000221012212002002210202220222 |
4 | 300123233322330031202231 |
5 | 210410001323430230404 |
6 | 2033012512342021125 |
7 | 62603455343015303 |
oct | 6033577274154255 |
9 | 1027185062722828 |
10 | 213013113133229 |
11 | 6196639913a132 |
12 | 1ba834507177a5 |
13 | 91b20868aa516 |
14 | 3a85c65424273 |
15 | 1995e5ea73dbe |
hex | c1bbfaf0d8ad |
213013113133229 has 2 divisors, whose sum is σ = 213013113133230. Its totient is φ = 213013113133228.
The previous prime is 213013113133199. The next prime is 213013113133241. The reversal of 213013113133229 is 922331311310312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 130770614508004 + 82242498625225 = 11435498^2 + 9068765^2 .
It is a cyclic number.
It is not a de Polignac number, because 213013113133229 - 244 = 195420927088813 is a prime.
It is a super-3 number, since 3×2130131131332293 (a number of 44 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213013113183229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106506556566614 + 106506556566615.
It is an arithmetic number, because the mean of its divisors is an integer number (106506556566615).
Almost surely, 2213013113133229 is an apocalyptic number.
It is an amenable number.
213013113133229 is a deficient number, since it is larger than the sum of its proper divisors (1).
213013113133229 is an equidigital number, since it uses as much as digits as its factorization.
213013113133229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 17496, while the sum is 35.
The spelling of 213013113133229 in words is "two hundred thirteen trillion, thirteen billion, one hundred thirteen million, one hundred thirty-three thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •