Base | Representation |
---|---|
bin | 101111001000000011… |
… | …1110010110101010101 |
3 | 100200012221210221111221 |
4 | 1132100013302311111 |
5 | 3124230231211013 |
6 | 114254110330341 |
7 | 10211612410213 |
oct | 1362007626525 |
9 | 320187727457 |
10 | 101202210133 |
11 | 39a130113a2 |
12 | 177444b99b1 |
13 | 970a8c8b9b |
14 | 4c809a7cb3 |
15 | 2974a6008d |
hex | 17901f2d55 |
101202210133 has 2 divisors, whose sum is σ = 101202210134. Its totient is φ = 101202210132.
The previous prime is 101202210097. The next prime is 101202210169. The reversal of 101202210133 is 331012202101.
It is a balanced prime because it is at equal distance from previous prime (101202210097) and next prime (101202210169).
It can be written as a sum of positive squares in only one way, i.e., 91546789489 + 9655420644 = 302567^2 + 98262^2 .
It is a cyclic number.
It is not a de Polignac number, because 101202210133 - 229 = 100665339221 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101202210433) 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, 50601105066 + 50601105067.
It is an arithmetic number, because the mean of its divisors is an integer number (50601105067).
Almost surely, 2101202210133 is an apocalyptic number.
It is an amenable number.
101202210133 is a deficient number, since it is larger than the sum of its proper divisors (1).
101202210133 is an equidigital number, since it uses as much as digits as its factorization.
101202210133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 101202210133 its reverse (331012202101), we get a palindrome (432214412234).
The spelling of 101202210133 in words is "one hundred one billion, two hundred two million, two hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •