Base | Representation |
---|---|
bin | 1001010010010011101010… |
… | …1100111001110001011101 |
3 | 1100011002002222001111202021 |
4 | 2110210322230321301131 |
5 | 2314240312230041333 |
6 | 33414244303100141 |
7 | 2102441226002221 |
oct | 224447254716135 |
9 | 40132088044667 |
10 | 10210122112093 |
11 | 32870a7833912 |
12 | 118a9592a1651 |
13 | 590a6c54b227 |
14 | 27425b67c781 |
15 | 12a8c6d4682d |
hex | 9493ab39c5d |
10210122112093 has 2 divisors, whose sum is σ = 10210122112094. Its totient is φ = 10210122112092.
The previous prime is 10210122112061. The next prime is 10210122112129. The reversal of 10210122112093 is 39021122101201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5212760223609 + 4997361888484 = 2283147^2 + 2235478^2 .
It is a cyclic number.
It is not a de Polignac number, because 10210122112093 - 25 = 10210122112061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10210122112793) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105061056046 + 5105061056047.
It is an arithmetic number, because the mean of its divisors is an integer number (5105061056047).
Almost surely, 210210122112093 is an apocalyptic number.
It is an amenable number.
10210122112093 is a deficient number, since it is larger than the sum of its proper divisors (1).
10210122112093 is an equidigital number, since it uses as much as digits as its factorization.
10210122112093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 25.
Adding to 10210122112093 its reverse (39021122101201), we get a palindrome (49231244213294).
The spelling of 10210122112093 in words is "ten trillion, two hundred ten billion, one hundred twenty-two million, one hundred twelve thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •