Base | Representation |
---|---|
bin | 10000000001011111010… |
… | …001010011110111111111 |
3 | 10220021011020201200001111 |
4 | 100001133101103313333 |
5 | 121020033130014101 |
6 | 2201502024422451 |
7 | 142360350403336 |
oct | 20013721236777 |
9 | 3807136650044 |
10 | 1101110001151 |
11 | 394a83987316 |
12 | 15949b617a27 |
13 | 7caaca4b1a4 |
14 | 3b418a8ad1d |
15 | 1d998160251 |
hex | 1005f453dff |
1101110001151 has 2 divisors, whose sum is σ = 1101110001152. Its totient is φ = 1101110001150.
The previous prime is 1101110001149. The next prime is 1101110001161. The reversal of 1101110001151 is 1511000111011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1101110001151 - 21 = 1101110001149 is a prime.
Together with 1101110001149, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101110001161) 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, 550555000575 + 550555000576.
It is an arithmetic number, because the mean of its divisors is an integer number (550555000576).
Almost surely, 21101110001151 is an apocalyptic number.
1101110001151 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101110001151 is an equidigital number, since it uses as much as digits as its factorization.
1101110001151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5, while the sum is 13.
Adding to 1101110001151 its reverse (1511000111011), we get a palindrome (2612110112162).
The spelling of 1101110001151 in words is "one trillion, one hundred one billion, one hundred ten million, one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •