Base | Representation |
---|---|
bin | 101111000101011010… |
… | …0000010001101011111 |
3 | 100122222202012220222011 |
4 | 1132022310002031133 |
5 | 3124034431103114 |
6 | 114241205332051 |
7 | 10206451354516 |
oct | 1361264021537 |
9 | 318882186864 |
10 | 101113144159 |
11 | 39977808855 |
12 | 1771a707027 |
13 | 96c5313121 |
14 | 4c72c2167d |
15 | 296bd1a1c4 |
hex | 178ad0235f |
101113144159 has 2 divisors, whose sum is σ = 101113144160. Its totient is φ = 101113144158.
The previous prime is 101113144117. The next prime is 101113144163. The reversal of 101113144159 is 951441311101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101113144159 - 211 = 101113142111 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101113144159.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101113144259) 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, 50556572079 + 50556572080.
It is an arithmetic number, because the mean of its divisors is an integer number (50556572080).
Almost surely, 2101113144159 is an apocalyptic number.
101113144159 is a deficient number, since it is larger than the sum of its proper divisors (1).
101113144159 is an equidigital number, since it uses as much as digits as its factorization.
101113144159 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 31.
The spelling of 101113144159 in words is "one hundred one billion, one hundred thirteen million, one hundred forty-four thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •