Base | Representation |
---|---|
bin | 1001010011001000000111… |
… | …0100101101010000100101 |
3 | 1100012102110002112121200221 |
4 | 2110302001310231100211 |
5 | 2320003130230222323 |
6 | 33424533250204341 |
7 | 2103450133065316 |
oct | 224620164552045 |
9 | 40172402477627 |
10 | 10224200242213 |
11 | 32920715463a1 |
12 | 1191627b836b1 |
13 | 5921a40b4339 |
14 | 274bd529260d |
15 | 12ae4cc5e55d |
hex | 94c81d2d425 |
10224200242213 has 2 divisors, whose sum is σ = 10224200242214. Its totient is φ = 10224200242212.
The previous prime is 10224200242177. The next prime is 10224200242231. The reversal of 10224200242213 is 31224200242201.
Together with next prime (10224200242231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10197656664129 + 26543578084 = 3193377^2 + 162922^2 .
It is a cyclic number.
It is not a de Polignac number, because 10224200242213 - 29 = 10224200241701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10224200240213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5112100121106 + 5112100121107.
It is an arithmetic number, because the mean of its divisors is an integer number (5112100121107).
Almost surely, 210224200242213 is an apocalyptic number.
It is an amenable number.
10224200242213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10224200242213 is an equidigital number, since it uses as much as digits as its factorization.
10224200242213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 10224200242213 its reverse (31224200242201), we get a palindrome (41448400484414).
The spelling of 10224200242213 in words is "ten trillion, two hundred twenty-four billion, two hundred million, two hundred forty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •