Base | Representation |
---|---|
bin | 101111001000111011… |
… | …0001001110100011001 |
3 | 100200021222020201222222 |
4 | 1132101312021310121 |
5 | 3124310132440441 |
6 | 114301022353425 |
7 | 10212413331206 |
oct | 1362166116431 |
9 | 320258221888 |
10 | 101231140121 |
11 | 39a28380981 |
12 | 1775212b875 |
13 | 97138b7b17 |
14 | 4c84778cad |
15 | 2977376d4b |
hex | 1791d89d19 |
101231140121 has 2 divisors, whose sum is σ = 101231140122. Its totient is φ = 101231140120.
The previous prime is 101231140111. The next prime is 101231140237. The reversal of 101231140121 is 121041132101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99615984400 + 1615155721 = 315620^2 + 40189^2 .
It is a cyclic number.
It is not a de Polignac number, because 101231140121 - 214 = 101231123737 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101231140121.
It is not a weakly prime, because it can be changed into another prime (101231140111) 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, 50615570060 + 50615570061.
It is an arithmetic number, because the mean of its divisors is an integer number (50615570061).
Almost surely, 2101231140121 is an apocalyptic number.
It is an amenable number.
101231140121 is a deficient number, since it is larger than the sum of its proper divisors (1).
101231140121 is an equidigital number, since it uses as much as digits as its factorization.
101231140121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 101231140121 its reverse (121041132101), we get a palindrome (222272272222).
The spelling of 101231140121 in words is "one hundred one billion, two hundred thirty-one million, one hundred forty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •