Base | Representation |
---|---|
bin | 10000000001101011010… |
… | …000001011011011011001 |
3 | 10220021200021000001011111 |
4 | 100001223100023123121 |
5 | 121020441110443001 |
6 | 2201534005300321 |
7 | 142365341210236 |
oct | 20015320133331 |
9 | 3807607001144 |
10 | 1101311031001 |
11 | 395077402a95 |
12 | 159536a046a1 |
13 | 7cb125a616c |
14 | 3b43765a78d |
15 | 1d9aab1e851 |
hex | 1006b40b6d9 |
1101311031001 has 4 divisors (see below), whose sum is σ = 1101484663552. Its totient is φ = 1101137398452.
The previous prime is 1101311030977. The next prime is 1101311031011. The reversal of 1101311031001 is 1001301131011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1101311031001 - 215 = 1101310998233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1101311031011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 86806761 + ... + 86819446.
It is an arithmetic number, because the mean of its divisors is an integer number (275371165888).
Almost surely, 21101311031001 is an apocalyptic number.
It is an amenable number.
1101311031001 is a deficient number, since it is larger than the sum of its proper divisors (173632551).
1101311031001 is an equidigital number, since it uses as much as digits as its factorization.
1101311031001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173632550.
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 1101311031001 its reverse (1001301131011), we get a palindrome (2102612162012).
The spelling of 1101311031001 in words is "one trillion, one hundred one billion, three hundred eleven million, thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •