Base | Representation |
---|---|
bin | 10011110011101110001… |
… | …101000010010000000001 |
3 | 11211010111210100110022111 |
4 | 103303232031002100001 |
5 | 134300222222410113 |
6 | 2521155053535321 |
7 | 200225645414161 |
oct | 23635615022001 |
9 | 4733453313274 |
10 | 1361206060033 |
11 | 485314374a86 |
12 | 19b9891a4541 |
13 | 9b49068b201 |
14 | 49c502a85a1 |
15 | 2561c4ae13d |
hex | 13cee342401 |
1361206060033 has 2 divisors, whose sum is σ = 1361206060034. Its totient is φ = 1361206060032.
The previous prime is 1361206060021. The next prime is 1361206060043. The reversal of 1361206060033 is 3300606021631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 953731934464 + 407474125569 = 976592^2 + 638337^2 .
It is a cyclic number.
It is not a de Polignac number, because 1361206060033 - 237 = 1223767106561 is a prime.
It is a super-2 number, since 2×13612060600332 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1361206059977 and 1361206060004.
It is not a weakly prime, because it can be changed into another prime (1361206060043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 680603030016 + 680603030017.
It is an arithmetic number, because the mean of its divisors is an integer number (680603030017).
Almost surely, 21361206060033 is an apocalyptic number.
It is an amenable number.
1361206060033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1361206060033 is an equidigital number, since it uses as much as digits as its factorization.
1361206060033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 31.
The spelling of 1361206060033 in words is "one trillion, three hundred sixty-one billion, two hundred six million, sixty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •