Base | Representation |
---|---|
bin | 11101001000101100110… |
… | …10000001101011000001 |
3 | 10112201000121110221100122 |
4 | 32210112122001223001 |
5 | 112400224421120223 |
6 | 2043522302030025 |
7 | 132220162441643 |
oct | 16442632015301 |
9 | 3481017427318 |
10 | 1001103301313 |
11 | 356624795565 |
12 | 14202b578315 |
13 | 73532a3405b |
14 | 3664cba4893 |
15 | 1b0935505c8 |
hex | e916681ac1 |
1001103301313 has 16 divisors (see below), whose sum is σ = 1070568576000. Its totient is φ = 932827007232.
The previous prime is 1001103301283. The next prime is 1001103301321. The reversal of 1001103301313 is 3131033011001.
It is a de Polignac number, because none of the positive numbers 2k-1001103301313 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1001103301291 and 1001103301300.
It is not an unprimeable number, because it can be changed into a prime (1001103301343) 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 15 ways as a sum of consecutive naturals, for example, 2118368 + ... + 2547486.
It is an arithmetic number, because the mean of its divisors is an integer number (66910536000).
Almost surely, 21001103301313 is an apocalyptic number.
It is an amenable number.
1001103301313 is a deficient number, since it is larger than the sum of its proper divisors (69465274687).
1001103301313 is a wasteful number, since it uses less digits than its factorization.
1001103301313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 430504.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 1001103301313 its reverse (3131033011001), we get a palindrome (4132136312314).
The spelling of 1001103301313 in words is "one trillion, one billion, one hundred three million, three hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •