Base | Representation |
---|---|
bin | 10000000001011000110… |
… | …001100000100101100001 |
3 | 10220020212122121220101110 |
4 | 100001120301200211201 |
5 | 121014322224020223 |
6 | 2201443132253533 |
7 | 142354555045503 |
oct | 20013061404541 |
9 | 3806778556343 |
10 | 1101001001313 |
11 | 394a283a9104 |
12 | 15946b0112a9 |
13 | 7ca932a6145 |
14 | 3b4083d5d73 |
15 | 1d98d7cdd93 |
hex | 10058c60961 |
1101001001313 has 8 divisors (see below), whose sum is σ = 1482536002176. Its totient is φ = 726733334000.
The previous prime is 1101001001279. The next prime is 1101001001369. The reversal of 1101001001313 is 3131001001011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1101001001313 - 26 = 1101001001249 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1101001001383) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1816833033 + ... + 1816833638.
It is an arithmetic number, because the mean of its divisors is an integer number (185317000272).
Almost surely, 21101001001313 is an apocalyptic number.
It is an amenable number.
1101001001313 is a deficient number, since it is larger than the sum of its proper divisors (381535000863).
1101001001313 is a wasteful number, since it uses less digits than its factorization.
1101001001313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3633666775.
The product of its (nonzero) digits is 9, while the sum is 12.
Adding to 1101001001313 its reverse (3131001001011), we get a palindrome (4232002002324).
The spelling of 1101001001313 in words is "one trillion, one hundred one billion, one million, one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •