Base | Representation |
---|---|
bin | 10011101010010000111… |
… | …001101001111100010011 |
3 | 11210011022001100222011002 |
4 | 103222100321221330103 |
5 | 134113422443422201 |
6 | 2512355242412215 |
7 | 166416204004232 |
oct | 23522071517423 |
9 | 4704261328132 |
10 | 1351050764051 |
11 | 480a82a3088a |
12 | 199a1420106b |
13 | 9a532769431 |
14 | 4956967cb19 |
15 | 25225b7776b |
hex | 13a90e69f13 |
1351050764051 has 2 divisors, whose sum is σ = 1351050764052. Its totient is φ = 1351050764050.
The previous prime is 1351050764029. The next prime is 1351050764081. The reversal of 1351050764051 is 1504670501531.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1351050764051 - 238 = 1076172857107 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1351050763996 and 1351050764014.
It is not a weakly prime, because it can be changed into another prime (1351050764081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 675525382025 + 675525382026.
It is an arithmetic number, because the mean of its divisors is an integer number (675525382026).
Almost surely, 21351050764051 is an apocalyptic number.
1351050764051 is a deficient number, since it is larger than the sum of its proper divisors (1).
1351050764051 is an equidigital number, since it uses as much as digits as its factorization.
1351050764051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 63000, while the sum is 38.
The spelling of 1351050764051 in words is "one trillion, three hundred fifty-one billion, fifty million, seven hundred sixty-four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •