Base | Representation |
---|---|
bin | 10111000000011100000000… |
… | …101111100110111101101111 |
3 | 111021021012112212111102001001 |
4 | 113000130000233212331233 |
5 | 101230304140113204311 |
6 | 555111452000101131 |
7 | 30212246161401226 |
oct | 2700340057467557 |
9 | 437235485442031 |
10 | 101185147006831 |
11 | 2a27141a6596a8 |
12 | b4224390047a7 |
13 | 445c9454a62a4 |
14 | 1adb55c861cbd |
15 | ba70d05334c1 |
hex | 5c0700be6f6f |
101185147006831 has 2 divisors, whose sum is σ = 101185147006832. Its totient is φ = 101185147006830.
The previous prime is 101185147006771. The next prime is 101185147006859. The reversal of 101185147006831 is 138600741581101.
It is a strong prime.
It is an emirp because it is prime and its reverse (138600741581101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101185147006831 - 211 = 101185147004783 is a prime.
It is a super-2 number, since 2×1011851470068312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101185147006861) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50592573503415 + 50592573503416.
It is an arithmetic number, because the mean of its divisors is an integer number (50592573503416).
Almost surely, 2101185147006831 is an apocalyptic number.
101185147006831 is a deficient number, since it is larger than the sum of its proper divisors (1).
101185147006831 is an equidigital number, since it uses as much as digits as its factorization.
101185147006831 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 161280, while the sum is 46.
Adding to 101185147006831 its reverse (138600741581101), we get a palindrome (239785888587932).
The spelling of 101185147006831 in words is "one hundred one trillion, one hundred eighty-five billion, one hundred forty-seven million, six thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •