Base | Representation |
---|---|
bin | 11101001000100000101… |
… | …00001100101001010101 |
3 | 10112200202111012002100221 |
4 | 32210100110030221111 |
5 | 112400022241010401 |
6 | 2043504211434341 |
7 | 132214512022246 |
oct | 16442024145125 |
9 | 3480674162327 |
10 | 1001001110101 |
11 | 356582037813 |
12 | 1420012b59b1 |
13 | 73517804095 |
14 | 3663d3a2ccd |
15 | 1b0895b67a1 |
hex | e91050ca55 |
1001001110101 has 4 divisors (see below), whose sum is σ = 1001027387500. Its totient is φ = 1000974832704.
The previous prime is 1001001110099. The next prime is 1001001110113. The reversal of 1001001110101 is 1010111001001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 391663188900 + 609337921201 = 625830^2 + 780601^2 .
It is a cyclic number.
It is not a de Polignac number, because 1001001110101 - 21 = 1001001110099 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001001170101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13081476 + ... + 13157773.
It is an arithmetic number, because the mean of its divisors is an integer number (250256846875).
Almost surely, 21001001110101 is an apocalyptic number.
It is an amenable number.
1001001110101 is a deficient number, since it is larger than the sum of its proper divisors (26277399).
1001001110101 is an equidigital number, since it uses as much as digits as its factorization.
1001001110101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26277398.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 1001001110101 its reverse (1010111001001), we get a palindrome (2011112111102).
The spelling of 1001001110101 in words is "one trillion, one billion, one million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.226 sec. • engine limits •