Base | Representation |
---|---|
bin | 11101011001111000110… |
… | …00010110110010011001 |
3 | 10120120211122202200100112 |
4 | 32230330120112302121 |
5 | 113023124031113223 |
6 | 2052050033214105 |
7 | 132664633061651 |
oct | 16547430266231 |
9 | 3516748680315 |
10 | 1010330332313 |
11 | 35a52a151515 |
12 | 143985701335 |
13 | 74373544103 |
14 | 36c863d7361 |
15 | 1b433625778 |
hex | eb3c616c99 |
1010330332313 has 4 divisors (see below), whose sum is σ = 1026893124708. Its totient is φ = 993767539920.
The previous prime is 1010330332279. The next prime is 1010330332321. The reversal of 1010330332313 is 3132330330101.
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 277804893184 + 732525439129 = 527072^2 + 855877^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010330332313 - 222 = 1010326138009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1010330332373) 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, 8281396106 + ... + 8281396227.
It is an arithmetic number, because the mean of its divisors is an integer number (256723281177).
Almost surely, 21010330332313 is an apocalyptic number.
It is an amenable number.
1010330332313 is a deficient number, since it is larger than the sum of its proper divisors (16562792395).
1010330332313 is an equidigital number, since it uses as much as digits as its factorization.
1010330332313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16562792394.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 1010330332313 its reverse (3132330330101), we get a palindrome (4142660662414).
The spelling of 1010330332313 in words is "one trillion, ten billion, three hundred thirty million, three hundred thirty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.737 sec. • engine limits •