Base | Representation |
---|---|
bin | 1001010100010010101000… |
… | …0001011100000100001101 |
3 | 1100021100002001102021011121 |
4 | 2111010222001130010031 |
5 | 2320320111204134013 |
6 | 33442042121520541 |
7 | 2105055606311503 |
oct | 225045201340415 |
9 | 40240061367147 |
10 | 10244202021133 |
11 | 329a5a5a7a9a3 |
12 | 119548a643151 |
13 | 594040c62892 |
14 | 275b718bc673 |
15 | 12b71dc2c58d |
hex | 9512a05c10d |
10244202021133 has 2 divisors, whose sum is σ = 10244202021134. Its totient is φ = 10244202021132.
The previous prime is 10244202021107. The next prime is 10244202021149. The reversal of 10244202021133 is 33112020244201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9773514092644 + 470687928489 = 3126262^2 + 686067^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10244202021133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10244202021098 and 10244202021107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10244202021173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5122101010566 + 5122101010567.
It is an arithmetic number, because the mean of its divisors is an integer number (5122101010567).
Almost surely, 210244202021133 is an apocalyptic number.
It is an amenable number.
10244202021133 is a deficient number, since it is larger than the sum of its proper divisors (1).
10244202021133 is an equidigital number, since it uses as much as digits as its factorization.
10244202021133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 10244202021133 its reverse (33112020244201), we get a palindrome (43356222265334).
The spelling of 10244202021133 in words is "ten trillion, two hundred forty-four billion, two hundred two million, twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •