Base | Representation |
---|---|
bin | 101111001011111001… |
… | …1101110111010100001 |
3 | 100200112221110201201122 |
4 | 1132113303232322201 |
5 | 3130011234401204 |
6 | 114314554342025 |
7 | 10215036503324 |
oct | 1362763567241 |
9 | 320487421648 |
10 | 101331168929 |
11 | 39a79892011 |
12 | 1777b72a915 |
13 | 972b53b773 |
14 | 4c93b767bb |
15 | 29810350be |
hex | 1797ceeea1 |
101331168929 has 2 divisors, whose sum is σ = 101331168930. Its totient is φ = 101331168928.
The previous prime is 101331168889. The next prime is 101331168941. The reversal of 101331168929 is 929861133101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91276494400 + 10054674529 = 302120^2 + 100273^2 .
It is an emirp because it is prime and its reverse (929861133101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101331168929 - 212 = 101331164833 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101331168929.
It is not a weakly prime, because it can be changed into another prime (101331168629) 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, 50665584464 + 50665584465.
It is an arithmetic number, because the mean of its divisors is an integer number (50665584465).
Almost surely, 2101331168929 is an apocalyptic number.
It is an amenable number.
101331168929 is a deficient number, since it is larger than the sum of its proper divisors (1).
101331168929 is an equidigital number, since it uses as much as digits as its factorization.
101331168929 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69984, while the sum is 44.
The spelling of 101331168929 in words is "one hundred one billion, three hundred thirty-one million, one hundred sixty-eight thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •