Base | Representation |
---|---|
bin | 11101011111010000011… |
… | …01010001101100111101 |
3 | 10120212021120012220121102 |
4 | 32233220031101230331 |
5 | 113100030023442203 |
6 | 2053244053142445 |
7 | 133126236216605 |
oct | 16575015215475 |
9 | 3525246186542 |
10 | 1013213109053 |
11 | 360779427332 |
12 | 14444b02aa25 |
13 | 74712864572 |
14 | 3707b207c05 |
15 | 1b551761888 |
hex | ebe8351b3d |
1013213109053 has 2 divisors, whose sum is σ = 1013213109054. Its totient is φ = 1013213109052.
The previous prime is 1013213109049. The next prime is 1013213109067. The reversal of 1013213109053 is 3509013123101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 811408211524 + 201804897529 = 900782^2 + 449227^2 .
It is a cyclic number.
It is not a de Polignac number, because 1013213109053 - 22 = 1013213109049 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1013213106053) 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, 506606554526 + 506606554527.
It is an arithmetic number, because the mean of its divisors is an integer number (506606554527).
Almost surely, 21013213109053 is an apocalyptic number.
It is an amenable number.
1013213109053 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013213109053 is an equidigital number, since it uses as much as digits as its factorization.
1013213109053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2430, while the sum is 29.
The spelling of 1013213109053 in words is "one trillion, thirteen billion, two hundred thirteen million, one hundred nine thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •