Base | Representation |
---|---|
bin | 10011101001100001110… |
… | …001011000100000110101 |
3 | 11210002020221112100211022 |
4 | 103221201301120200311 |
5 | 134110313034110412 |
6 | 2512144555150525 |
7 | 166360463123156 |
oct | 23514161304065 |
9 | 4702227470738 |
10 | 1350260066357 |
11 | 480707673a14 |
12 | 199833445445 |
13 | 9a4379c2687 |
14 | 494d265592d |
15 | 251cb53ba72 |
hex | 13a61c58835 |
1350260066357 has 2 divisors, whose sum is σ = 1350260066358. Its totient is φ = 1350260066356.
The previous prime is 1350260066297. The next prime is 1350260066417. The reversal of 1350260066357 is 7536600620531.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (1350260066297) and next prime (1350260066417).
It can be written as a sum of positive squares in only one way, i.e., 1249821146116 + 100438920241 = 1117954^2 + 316921^2 .
It is a cyclic number.
It is not a de Polignac number, because 1350260066357 - 216 = 1350260000821 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1350260066557) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 675130033178 + 675130033179.
It is an arithmetic number, because the mean of its divisors is an integer number (675130033179).
Almost surely, 21350260066357 is an apocalyptic number.
It is an amenable number.
1350260066357 is a deficient number, since it is larger than the sum of its proper divisors (1).
1350260066357 is an equidigital number, since it uses as much as digits as its factorization.
1350260066357 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 680400, while the sum is 44.
Adding to 1350260066357 its reverse (7536600620531), we get a palindrome (8886860686888).
The spelling of 1350260066357 in words is "one trillion, three hundred fifty billion, two hundred sixty million, sixty-six thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •