Base | Representation |
---|---|
bin | 101111001110111100… |
… | …1011111000011010101 |
3 | 100200211001201120020201 |
4 | 1132131321133003111 |
5 | 3130213413340432 |
6 | 114333044300501 |
7 | 10220420110444 |
oct | 1363571370325 |
9 | 320731646221 |
10 | 101433340117 |
11 | 3a02152680a |
12 | 177a99a1731 |
13 | 97467625a5 |
14 | 4ca3570d5b |
15 | 2989eb7ee7 |
hex | 179de5f0d5 |
101433340117 has 2 divisors, whose sum is σ = 101433340118. Its totient is φ = 101433340116.
The previous prime is 101433340081. The next prime is 101433340121. The reversal of 101433340117 is 711043334101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101433332196 + 7921 = 318486^2 + 89^2 .
It is an emirp because it is prime and its reverse (711043334101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101433340117 - 227 = 101299122389 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101433340417) 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, 50716670058 + 50716670059.
It is an arithmetic number, because the mean of its divisors is an integer number (50716670059).
Almost surely, 2101433340117 is an apocalyptic number.
It is an amenable number.
101433340117 is a deficient number, since it is larger than the sum of its proper divisors (1).
101433340117 is an equidigital number, since it uses as much as digits as its factorization.
101433340117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 28.
Adding to 101433340117 its reverse (711043334101), we get a palindrome (812476674218).
The spelling of 101433340117 in words is "one hundred one billion, four hundred thirty-three million, three hundred forty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •