Base | Representation |
---|---|
bin | 11101011111000110100… |
… | …01011011001010111101 |
3 | 10120212001210102022010011 |
4 | 32233203101123022331 |
5 | 113044342324412313 |
6 | 2053231534343221 |
7 | 133124212356121 |
oct | 16574321331275 |
9 | 3525053368104 |
10 | 1013130310333 |
11 | 360736714439 |
12 | 14442735ab11 |
13 | 746cb66433b |
14 | 37070213581 |
15 | 1b54935893d |
hex | ebe345b2bd |
1013130310333 has 4 divisors (see below), whose sum is σ = 1013186685340. Its totient is φ = 1013073935328.
The previous prime is 1013130310331. The next prime is 1013130310433. The reversal of 1013130310333 is 3330130313101.
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 463103387289 + 550026923044 = 680517^2 + 741638^2 .
It is a cyclic number.
It is not a de Polignac number, because 1013130310333 - 21 = 1013130310331 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 (1013130310331) 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, 28160538 + ... + 28196491.
It is an arithmetic number, because the mean of its divisors is an integer number (253296671335).
Almost surely, 21013130310333 is an apocalyptic number.
It is an amenable number.
1013130310333 is a deficient number, since it is larger than the sum of its proper divisors (56375007).
1013130310333 is an equidigital number, since it uses as much as digits as its factorization.
1013130310333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56375006.
The product of its (nonzero) digits is 729, while the sum is 22.
Adding to 1013130310333 its reverse (3330130313101), we get a palindrome (4343260623434).
The spelling of 1013130310333 in words is "one trillion, thirteen billion, one hundred thirty million, three hundred ten thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •