Base | Representation |
---|---|
bin | 101111000010111101… |
… | …1111001111000101101 |
3 | 100122210001020212212201 |
4 | 1132011323321320231 |
5 | 3123403004234013 |
6 | 114225123501501 |
7 | 10204436026441 |
oct | 1360573717055 |
9 | 318701225781 |
10 | 101031321133 |
11 | 39935601a16 |
12 | 176b7227891 |
13 | 96b1395032 |
14 | 4c66002821 |
15 | 2964a563dd |
hex | 1785ef9e2d |
101031321133 has 2 divisors, whose sum is σ = 101031321134. Its totient is φ = 101031321132.
The previous prime is 101031321121. The next prime is 101031321199. The reversal of 101031321133 is 331123130101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 73209748329 + 27821572804 = 270573^2 + 166798^2 .
It is a cyclic number.
It is not a de Polignac number, because 101031321133 - 217 = 101031190061 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101031321133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101031321103) 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, 50515660566 + 50515660567.
It is an arithmetic number, because the mean of its divisors is an integer number (50515660567).
Almost surely, 2101031321133 is an apocalyptic number.
It is an amenable number.
101031321133 is a deficient number, since it is larger than the sum of its proper divisors (1).
101031321133 is an equidigital number, since it uses as much as digits as its factorization.
101031321133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 101031321133 its reverse (331123130101), we get a palindrome (432154451234).
The spelling of 101031321133 in words is "one hundred one billion, thirty-one million, three hundred twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •