Base | Representation |
---|---|
bin | 1011001001010110101110… |
… | …0011000000100111000001 |
3 | 1121101121012010200200110002 |
4 | 2302111223203000213001 |
5 | 3101242422041111022 |
6 | 42022010033445345 |
7 | 2403263620341362 |
oct | 262255343004701 |
9 | 47347163620402 |
10 | 12255346035137 |
11 | 39a5510382407 |
12 | 145b202710855 |
13 | 6ab89c20597a |
14 | 30523a409b69 |
15 | 163bca245092 |
hex | b256b8c09c1 |
12255346035137 has 2 divisors, whose sum is σ = 12255346035138. Its totient is φ = 12255346035136.
The previous prime is 12255346035073. The next prime is 12255346035169. The reversal of 12255346035137 is 73153064355221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8318788461361 + 3936557573776 = 2884231^2 + 1984076^2 .
It is a cyclic number.
It is not a de Polignac number, because 12255346035137 - 26 = 12255346035073 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12255346035091 and 12255346035100.
It is not a weakly prime, because it can be changed into another prime (12255346035197) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6127673017568 + 6127673017569.
It is an arithmetic number, because the mean of its divisors is an integer number (6127673017569).
Almost surely, 212255346035137 is an apocalyptic number.
It is an amenable number.
12255346035137 is a deficient number, since it is larger than the sum of its proper divisors (1).
12255346035137 is an equidigital number, since it uses as much as digits as its factorization.
12255346035137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268000, while the sum is 47.
The spelling of 12255346035137 in words is "twelve trillion, two hundred fifty-five billion, three hundred forty-six million, thirty-five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •