Base | Representation |
---|---|
bin | 10111000010010101010110… |
… | …111000001000010101011111 |
3 | 111021201122212021211010211011 |
4 | 113002111112320020111133 |
5 | 101234423010410201002 |
6 | 555251400542440051 |
7 | 30224541036044362 |
oct | 2702252670102537 |
9 | 437648767733734 |
10 | 101315441100127 |
11 | 2a311701238441 |
12 | b443740293027 |
13 | 446c00b28b207 |
14 | 1b0399d0040d9 |
15 | baa6a90da8d7 |
hex | 5c2556e0855f |
101315441100127 has 2 divisors, whose sum is σ = 101315441100128. Its totient is φ = 101315441100126.
The previous prime is 101315441100121. The next prime is 101315441100199. The reversal of 101315441100127 is 721001144513101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101315441100127 - 23 = 101315441100119 is a prime.
It is a super-2 number, since 2×1013154411001272 (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 (101315441100121) 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, 50657720550063 + 50657720550064.
It is an arithmetic number, because the mean of its divisors is an integer number (50657720550064).
Almost surely, 2101315441100127 is an apocalyptic number.
101315441100127 is a deficient number, since it is larger than the sum of its proper divisors (1).
101315441100127 is an equidigital number, since it uses as much as digits as its factorization.
101315441100127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3360, while the sum is 31.
Adding to 101315441100127 its reverse (721001144513101), we get a palindrome (822316585613228).
The spelling of 101315441100127 in words is "one hundred one trillion, three hundred fifteen billion, four hundred forty-one million, one hundred thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •