Base | Representation |
---|---|
bin | 101111010001010001… |
… | …1011011000000111101 |
3 | 100201000111200120120022 |
4 | 1132202203123000331 |
5 | 3130343412124433 |
6 | 114344514301525 |
7 | 10222356011246 |
oct | 1364243330075 |
9 | 321014616508 |
10 | 101511442493 |
11 | 3a06162122a |
12 | 1780bb878a5 |
13 | 97599aa006 |
14 | 4cadaa1ccd |
15 | 2991c94698 |
hex | 17a28db03d |
101511442493 has 2 divisors, whose sum is σ = 101511442494. Its totient is φ = 101511442492.
The previous prime is 101511442451. The next prime is 101511442507. The reversal of 101511442493 is 394244115101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 82830566809 + 18680875684 = 287803^2 + 136678^2 .
It is an emirp because it is prime and its reverse (394244115101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101511442493 - 220 = 101510393917 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101511642493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50755721246 + 50755721247.
It is an arithmetic number, because the mean of its divisors is an integer number (50755721247).
Almost surely, 2101511442493 is an apocalyptic number.
It is an amenable number.
101511442493 is a deficient number, since it is larger than the sum of its proper divisors (1).
101511442493 is an equidigital number, since it uses as much as digits as its factorization.
101511442493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 35.
Adding to 101511442493 its reverse (394244115101), we get a palindrome (495755557594).
The spelling of 101511442493 in words is "one hundred one billion, five hundred eleven million, four hundred forty-two thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •