Base | Representation |
---|---|
bin | 10011000111000000111… |
… | …100001100011101100001 |
3 | 11122112121022022002100021 |
4 | 103013000330030131201 |
5 | 133003414204433213 |
6 | 2443135432553441 |
7 | 163606241041126 |
oct | 23070074143541 |
9 | 4575538262307 |
10 | 1313202030433 |
11 | 466a20347047 |
12 | 192610852881 |
13 | 96ab02b4677 |
14 | 477b8aa474d |
15 | 2425ce82d8d |
hex | 131c0f0c761 |
1313202030433 has 2 divisors, whose sum is σ = 1313202030434. Its totient is φ = 1313202030432.
The previous prime is 1313202030409. The next prime is 1313202030463. The reversal of 1313202030433 is 3340302023131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1146597648849 + 166604381584 = 1070793^2 + 408172^2 .
It is an emirp because it is prime and its reverse (3340302023131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1313202030433 - 233 = 1304612095841 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1313202030398 and 1313202030407.
It is not a weakly prime, because it can be changed into another prime (1313202030463) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656601015216 + 656601015217.
It is an arithmetic number, because the mean of its divisors is an integer number (656601015217).
Almost surely, 21313202030433 is an apocalyptic number.
It is an amenable number.
1313202030433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1313202030433 is an equidigital number, since it uses as much as digits as its factorization.
1313202030433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 1313202030433 its reverse (3340302023131), we get a palindrome (4653504053564).
The spelling of 1313202030433 in words is "one trillion, three hundred thirteen billion, two hundred two million, thirty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •