Base | Representation |
---|---|
bin | 1011001101111111101100… |
… | …1110101111101011101101 |
3 | 1121200012221221222012122111 |
4 | 2303133323032233223231 |
5 | 3104044203402201412 |
6 | 42122352350244021 |
7 | 2412115302326515 |
oct | 263377316575355 |
9 | 47605857865574 |
10 | 12335066053357 |
11 | 3a262aa237a93 |
12 | 14727507b6611 |
13 | 6b626532b498 |
14 | 30903dd02845 |
15 | 165ce3d5b2a7 |
hex | b37fb3afaed |
12335066053357 has 2 divisors, whose sum is σ = 12335066053358. Its totient is φ = 12335066053356.
The previous prime is 12335066053309. The next prime is 12335066053369. The reversal of 12335066053357 is 75335066053321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6347482175241 + 5987583878116 = 2519421^2 + 2446954^2 .
It is a cyclic number.
It is not a de Polignac number, because 12335066053357 - 27 = 12335066053229 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12335066053357.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12335066453357) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6167533026678 + 6167533026679.
It is an arithmetic number, because the mean of its divisors is an integer number (6167533026679).
Almost surely, 212335066053357 is an apocalyptic number.
It is an amenable number.
12335066053357 is a deficient number, since it is larger than the sum of its proper divisors (1).
12335066053357 is an equidigital number, since it uses as much as digits as its factorization.
12335066053357 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5103000, while the sum is 49.
The spelling of 12335066053357 in words is "twelve trillion, three hundred thirty-five billion, sixty-six million, fifty-three thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •