Base | Representation |
---|---|
bin | 1011000011110110000001… |
… | …0100001101010100100001 |
3 | 1121001112210212212200112211 |
4 | 2300331200110031110201 |
5 | 3043220022042401103 |
6 | 41510311153522121 |
7 | 2363402461154365 |
oct | 260754024152441 |
9 | 47045725780484 |
10 | 12160668325153 |
11 | 39693462725a7 |
12 | 144499b273341 |
13 | 6a299125847a |
14 | 3008181832a5 |
15 | 1614d83c536d |
hex | b0f6050d521 |
12160668325153 has 2 divisors, whose sum is σ = 12160668325154. Its totient is φ = 12160668325152.
The previous prime is 12160668325139. The next prime is 12160668325213. The reversal of 12160668325153 is 35152386606121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11536810041744 + 623858283409 = 3396588^2 + 789847^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12160668325153 is a prime.
It is a super-2 number, since 2×121606683251532 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12160668325097 and 12160668325106.
It is not a weakly prime, because it can be changed into another prime (12160668325103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6080334162576 + 6080334162577.
It is an arithmetic number, because the mean of its divisors is an integer number (6080334162577).
Almost surely, 212160668325153 is an apocalyptic number.
It is an amenable number.
12160668325153 is a deficient number, since it is larger than the sum of its proper divisors (1).
12160668325153 is an equidigital number, since it uses as much as digits as its factorization.
12160668325153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1555200, while the sum is 49.
The spelling of 12160668325153 in words is "twelve trillion, one hundred sixty billion, six hundred sixty-eight million, three hundred twenty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •