Base | Representation |
---|---|
bin | 101111000101101001… |
… | …0000011001100001011 |
3 | 100200000022000200021212 |
4 | 1132023102003030023 |
5 | 3124043434344431 |
6 | 114242050123335 |
7 | 10206605265332 |
oct | 1361322031413 |
9 | 320008020255 |
10 | 101121012491 |
11 | 399811a2404 |
12 | 1772128054b |
13 | 96c6b39645 |
14 | 4c73cacd19 |
15 | 296c87172b |
hex | 178b48330b |
101121012491 has 2 divisors, whose sum is σ = 101121012492. Its totient is φ = 101121012490.
The previous prime is 101121012413. The next prime is 101121012497. The reversal of 101121012491 is 194210121101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101121012491 - 214 = 101120996107 is a prime.
It is not a weakly prime, because it can be changed into another prime (101121012497) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50560506245 + 50560506246.
It is an arithmetic number, because the mean of its divisors is an integer number (50560506246).
Almost surely, 2101121012491 is an apocalyptic number.
101121012491 is a deficient number, since it is larger than the sum of its proper divisors (1).
101121012491 is an equidigital number, since it uses as much as digits as its factorization.
101121012491 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 23.
Adding to 101121012491 its reverse (194210121101), we get a palindrome (295331133592).
The spelling of 101121012491 in words is "one hundred one billion, one hundred twenty-one million, twelve thousand, four hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •