Base | Representation |
---|---|
bin | 1001010011101010001000… |
… | …0101000010110010100101 |
3 | 1100020022000110021221122101 |
4 | 2110322202011002302211 |
5 | 2320130330310031323 |
6 | 33433043313132101 |
7 | 2104222330051165 |
oct | 224724205026245 |
9 | 40208013257571 |
10 | 10233331330213 |
11 | 3295a27831a12 |
12 | 1193355b5a031 |
13 | 592ccaa713a4 |
14 | 27541dc6c5a5 |
15 | 12b2d46d1dad |
hex | 94ea2142ca5 |
10233331330213 has 2 divisors, whose sum is σ = 10233331330214. Its totient is φ = 10233331330212.
The previous prime is 10233331330199. The next prime is 10233331330253. The reversal of 10233331330213 is 31203313333201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9614476921284 + 618854408929 = 3100722^2 + 786673^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10233331330213 is a prime.
It is a super-2 number, since 2×102333313302132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10233331330253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5116665665106 + 5116665665107.
It is an arithmetic number, because the mean of its divisors is an integer number (5116665665107).
Almost surely, 210233331330213 is an apocalyptic number.
It is an amenable number.
10233331330213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10233331330213 is an equidigital number, since it uses as much as digits as its factorization.
10233331330213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8748, while the sum is 28.
Adding to 10233331330213 its reverse (31203313333201), we get a palindrome (41436644663414).
The spelling of 10233331330213 in words is "ten trillion, two hundred thirty-three billion, three hundred thirty-one million, three hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •