Base | Representation |
---|---|
bin | 10011010110110000111… |
… | …011001100011101010001 |
3 | 11201011020212122121112222 |
4 | 103112300323030131101 |
5 | 133243032434431001 |
6 | 2455013502030425 |
7 | 165045305446253 |
oct | 23266073143521 |
9 | 4634225577488 |
10 | 1330113202001 |
11 | 4731092545a1 |
12 | 195950278415 |
13 | 98576a7616c |
14 | 48540a5dcd3 |
15 | 248ec96061b |
hex | 135b0ecc751 |
1330113202001 has 2 divisors, whose sum is σ = 1330113202002. Its totient is φ = 1330113202000.
The previous prime is 1330113201941. The next prime is 1330113202013. The reversal of 1330113202001 is 1002023110331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 876273849025 + 453839352976 = 936095^2 + 673676^2 .
It is a cyclic number.
It is not a de Polignac number, because 1330113202001 - 214 = 1330113185617 is a prime.
It is a super-2 number, since 2×13301132020012 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1330113202021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 665056601000 + 665056601001.
It is an arithmetic number, because the mean of its divisors is an integer number (665056601001).
Almost surely, 21330113202001 is an apocalyptic number.
It is an amenable number.
1330113202001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1330113202001 is an equidigital number, since it uses as much as digits as its factorization.
1330113202001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1330113202001 its reverse (1002023110331), we get a palindrome (2332136312332).
The spelling of 1330113202001 in words is "one trillion, three hundred thirty billion, one hundred thirteen million, two hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •