Base | Representation |
---|---|
bin | 1001010011101001101100… |
… | …0110010001010000101001 |
3 | 1100020021201021220200102221 |
4 | 2110322123012101100221 |
5 | 2320130110314223423 |
6 | 33433023530554041 |
7 | 2104216405416115 |
oct | 224723306212051 |
9 | 40207637820387 |
10 | 10233214211113 |
11 | 3295977708673 |
12 | 1193322898921 |
13 | 592cac71584a |
14 | 27540c4a2745 |
15 | 12b2c9299e5d |
hex | 94e9b191429 |
10233214211113 has 2 divisors, whose sum is σ = 10233214211114. Its totient is φ = 10233214211112.
The previous prime is 10233214211083. The next prime is 10233214211119. The reversal of 10233214211113 is 31111241233201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6206236877824 + 4026977333289 = 2491232^2 + 2006733^2 .
It is a cyclic number.
It is not a de Polignac number, because 10233214211113 - 25 = 10233214211081 is a prime.
It is not a weakly prime, because it can be changed into another prime (10233214211119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5116607105556 + 5116607105557.
It is an arithmetic number, because the mean of its divisors is an integer number (5116607105557).
Almost surely, 210233214211113 is an apocalyptic number.
It is an amenable number.
10233214211113 is a deficient number, since it is larger than the sum of its proper divisors (1).
10233214211113 is an equidigital number, since it uses as much as digits as its factorization.
10233214211113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 10233214211113 its reverse (31111241233201), we get a palindrome (41344455444314).
The spelling of 10233214211113 in words is "ten trillion, two hundred thirty-three billion, two hundred fourteen million, two hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •