Base | Representation |
---|---|
bin | 11101011110111100011… |
… | …01101101010110000001 |
3 | 10120211211212201221210001 |
4 | 32233132031231112001 |
5 | 113044204113400423 |
6 | 2053215303440001 |
7 | 133122132151204 |
oct | 16573615552601 |
9 | 3524755657701 |
10 | 1013045450113 |
11 | 3606a2823724 |
12 | 144402a56001 |
13 | 746b6bc19a8 |
14 | 37062c4393b |
15 | 1b541b94cad |
hex | ebde36d581 |
1013045450113 has 2 divisors, whose sum is σ = 1013045450114. Its totient is φ = 1013045450112.
The previous prime is 1013045450101. The next prime is 1013045450117. The reversal of 1013045450113 is 3110545403101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 742471742224 + 270573707889 = 861668^2 + 520167^2 .
It is an emirp because it is prime and its reverse (3110545403101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1013045450113 - 213 = 1013045441921 is a prime.
It is a super-2 number, since 2×10130454501132 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1013045450117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506522725056 + 506522725057.
It is an arithmetic number, because the mean of its divisors is an integer number (506522725057).
Almost surely, 21013045450113 is an apocalyptic number.
It is an amenable number.
1013045450113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013045450113 is an equidigital number, since it uses as much as digits as its factorization.
1013045450113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 28.
The spelling of 1013045450113 in words is "one trillion, thirteen billion, forty-five million, four hundred fifty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •