Base | Representation |
---|---|
bin | 101111001100101001… |
… | …0111100110111110101 |
3 | 100200121200102212120122 |
4 | 1132121102330313311 |
5 | 3130034132123111 |
6 | 114321245341325 |
7 | 10215461613434 |
oct | 1363122746765 |
9 | 320550385518 |
10 | 101356129781 |
11 | 39a91990515 |
12 | 17787b67845 |
13 | 973376abba |
14 | 4c971d311b |
15 | 2983315cdb |
hex | 17994bcdf5 |
101356129781 has 2 divisors, whose sum is σ = 101356129782. Its totient is φ = 101356129780.
The previous prime is 101356129757. The next prime is 101356129799. The reversal of 101356129781 is 187921653101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83604831025 + 17751298756 = 289145^2 + 133234^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101356129781 is a prime.
It is a super-2 number, since 2×1013561297812 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101356129711) 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, 50678064890 + 50678064891.
It is an arithmetic number, because the mean of its divisors is an integer number (50678064891).
Almost surely, 2101356129781 is an apocalyptic number.
It is an amenable number.
101356129781 is a deficient number, since it is larger than the sum of its proper divisors (1).
101356129781 is an equidigital number, since it uses as much as digits as its factorization.
101356129781 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90720, while the sum is 44.
The spelling of 101356129781 in words is "one hundred one billion, three hundred fifty-six million, one hundred twenty-nine thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •