Base | Representation |
---|---|
bin | 1001101001001110000001… |
… | …0010110010011111110001 |
3 | 1101112201010000220021021002 |
4 | 2122103200102302133301 |
5 | 2342212431012331322 |
6 | 34315143022011345 |
7 | 2143044422320253 |
oct | 232234022623761 |
9 | 41481100807232 |
10 | 10603742308337 |
11 | 3419027104222 |
12 | 12330aba16b55 |
13 | 5bbc0c200a59 |
14 | 28931c407cd3 |
15 | 135c635d2c92 |
hex | 9a4e04b27f1 |
10603742308337 has 2 divisors, whose sum is σ = 10603742308338. Its totient is φ = 10603742308336.
The previous prime is 10603742308273. The next prime is 10603742308343. The reversal of 10603742308337 is 73380324730601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10449857925376 + 153884382961 = 3232624^2 + 392281^2 .
It is a cyclic number.
It is not a de Polignac number, because 10603742308337 - 26 = 10603742308273 is a prime.
It is a super-2 number, since 2×106037423083372 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10603742308291 and 10603742308300.
It is not a weakly prime, because it can be changed into another prime (10603742308637) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5301871154168 + 5301871154169.
It is an arithmetic number, because the mean of its divisors is an integer number (5301871154169).
Almost surely, 210603742308337 is an apocalyptic number.
It is an amenable number.
10603742308337 is a deficient number, since it is larger than the sum of its proper divisors (1).
10603742308337 is an equidigital number, since it uses as much as digits as its factorization.
10603742308337 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1524096, while the sum is 47.
The spelling of 10603742308337 in words is "ten trillion, six hundred three billion, seven hundred forty-two million, three hundred eight thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •