Base | Representation |
---|---|
bin | 11101001000101101110… |
… | …11100110001001111101 |
3 | 10112201001020001000221112 |
4 | 32210112323212021331 |
5 | 112400234144222001 |
6 | 2043523214411405 |
7 | 132220330313321 |
oct | 16442673461175 |
9 | 3481036030845 |
10 | 1001112101501 |
11 | 356629756246 |
12 | 142032500b65 |
13 | 735347c5775 |
14 | 36650015981 |
15 | 1b0941dccbb |
hex | e916ee627d |
1001112101501 has 2 divisors, whose sum is σ = 1001112101502. Its totient is φ = 1001112101500.
The previous prime is 1001112101491. The next prime is 1001112101503. The reversal of 1001112101501 is 1051012111001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 730467646276 + 270644455225 = 854674^2 + 520235^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1001112101501 is a prime.
Together with 1001112101503, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1001112101503) 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, 500556050750 + 500556050751.
It is an arithmetic number, because the mean of its divisors is an integer number (500556050751).
Almost surely, 21001112101501 is an apocalyptic number.
It is an amenable number.
1001112101501 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001112101501 is an equidigital number, since it uses as much as digits as its factorization.
1001112101501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10, while the sum is 14.
Adding to 1001112101501 its reverse (1051012111001), we get a palindrome (2052124212502).
The spelling of 1001112101501 in words is "one trillion, one billion, one hundred twelve million, one hundred one thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •