Base | Representation |
---|---|
bin | 1100011010001110111… |
… | …0010101100000100001 |
3 | 202101022021211212110212 |
4 | 3012203232111200201 |
5 | 11443113224333213 |
6 | 241535352503505 |
7 | 21255205025561 |
oct | 3064356254041 |
9 | 671267755425 |
10 | 213200230433 |
11 | 82465a76753 |
12 | 353a03aab95 |
13 | 17149029008 |
14 | a46728cda1 |
15 | 582c2789a8 |
hex | 31a3b95821 |
213200230433 has 2 divisors, whose sum is σ = 213200230434. Its totient is φ = 213200230432.
The previous prime is 213200230427. The next prime is 213200230469. The reversal of 213200230433 is 334032002312.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 149639769889 + 63560460544 = 386833^2 + 252112^2 .
It is a cyclic number.
It is not a de Polignac number, because 213200230433 - 210 = 213200229409 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 213200230399 and 213200230408.
It is not a weakly prime, because it can be changed into another prime (213200230483) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106600115216 + 106600115217.
It is an arithmetic number, because the mean of its divisors is an integer number (106600115217).
Almost surely, 2213200230433 is an apocalyptic number.
It is an amenable number.
213200230433 is a deficient number, since it is larger than the sum of its proper divisors (1).
213200230433 is an equidigital number, since it uses as much as digits as its factorization.
213200230433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 213200230433 its reverse (334032002312), we get a palindrome (547232232745).
The spelling of 213200230433 in words is "two hundred thirteen billion, two hundred million, two hundred thirty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •